./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 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/forester-heap/dll-optional-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:02:58,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:02:58,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:02:58,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:02:58,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:02:58,820 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:02:58,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:02:58,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:02:58,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:02:58,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:02:58,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:02:58,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:02:58,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:02:58,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:02:58,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:02:58,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:02:58,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:02:58,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:02:58,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:02:58,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:02:58,858 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:02:58,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:02:58,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:02:58,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:02:58,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:02:58,867 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:02:58,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:02:58,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:02:58,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:02:58,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:02:58,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:02:58,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:02:58,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:02:58,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:02:58,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:02:58,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:02:58,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:02:58,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:02:58,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:02:58,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:02:58,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:02:58,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:02:58,891 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:02:58,924 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:02:58,924 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:02:58,925 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:02:58,925 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:02:58,925 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:02:58,925 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:02:58,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:02:58,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:02:58,926 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:02:58,927 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:02:58,927 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:02:58,927 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:02:58,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:02:58,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:02:58,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:02:58,928 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:02:58,928 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:02:58,928 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:02:58,928 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:02:58,928 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:02:58,928 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:02:58,929 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:02:58,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:02:58,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:02:58,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:02:58,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:02:58,929 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:02:58,929 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:02:58,930 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:02:58,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:02:58,930 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 -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2022-07-20 06:02:59,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:02:59,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:02:59,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:02:59,370 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:02:59,372 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:02:59,375 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-optional-1.i [2022-07-20 06:02:59,462 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9545828c4/fff64e164ef04922951557dafb5da22e/FLAG27bb94b03 [2022-07-20 06:03:00,302 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:03:00,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2022-07-20 06:03:00,314 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9545828c4/fff64e164ef04922951557dafb5da22e/FLAG27bb94b03 [2022-07-20 06:03:00,431 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9545828c4/fff64e164ef04922951557dafb5da22e [2022-07-20 06:03:00,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:03:00,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:03:00,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:03:00,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:03:00,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:03:00,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:03:00" (1/1) ... [2022-07-20 06:03:00,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b414df0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:03:00, skipping insertion in model container [2022-07-20 06:03:00,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:03:00" (1/1) ... [2022-07-20 06:03:00,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:03:00,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:03:00,928 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/forester-heap/dll-optional-1.i[22753,22766] [2022-07-20 06:03:00,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:03:00,961 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:03:01,041 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/forester-heap/dll-optional-1.i[22753,22766] [2022-07-20 06:03:01,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:03:01,105 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:03:01,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:03:01 WrapperNode [2022-07-20 06:03:01,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:03:01,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:03:01,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:03:01,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:03:01,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:03:01" (1/1) ... [2022-07-20 06:03:01,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:03:01" (1/1) ... [2022-07-20 06:03:01,208 INFO L137 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 140 [2022-07-20 06:03:01,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:03:01,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:03:01,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:03:01,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:03:01,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:03:01" (1/1) ... [2022-07-20 06:03:01,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:03:01" (1/1) ... [2022-07-20 06:03:01,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:03:01" (1/1) ... [2022-07-20 06:03:01,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:03:01" (1/1) ... [2022-07-20 06:03:01,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:03:01" (1/1) ... [2022-07-20 06:03:01,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:03:01" (1/1) ... [2022-07-20 06:03:01,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:03:01" (1/1) ... [2022-07-20 06:03:01,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:03:01,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:03:01,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:03:01,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:03:01,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:03:01" (1/1) ... [2022-07-20 06:03:01,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:03:01,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:01,353 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-20 06:03:01,383 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-20 06:03:01,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 06:03:01,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 06:03:01,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:03:01,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:03:01,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:03:01,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:03:01,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:03:01,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:03:01,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:03:01,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:03:01,579 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:03:01,589 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:03:02,140 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:03:02,169 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:03:02,169 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-20 06:03:02,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:03:02 BoogieIcfgContainer [2022-07-20 06:03:02,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:03:02,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:03:02,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:03:02,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:03:02,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:03:00" (1/3) ... [2022-07-20 06:03:02,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2348d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:03:02, skipping insertion in model container [2022-07-20 06:03:02,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:03:01" (2/3) ... [2022-07-20 06:03:02,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2348d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:03:02, skipping insertion in model container [2022-07-20 06:03:02,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:03:02" (3/3) ... [2022-07-20 06:03:02,179 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2022-07-20 06:03:02,205 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:03:02,205 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-07-20 06:03:02,340 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:03:02,361 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@30a9eb06, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50d8d637 [2022-07-20 06:03:02,362 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-07-20 06:03:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 80 states have (on average 2.1125) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:03:02,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:02,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:03:02,382 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:02,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:02,391 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 06:03:02,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:02,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438082325] [2022-07-20 06:03:02,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:02,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:02,563 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-20 06:03:02,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:02,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438082325] [2022-07-20 06:03:02,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438082325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:02,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:02,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:03:02,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467192625] [2022-07-20 06:03:02,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:02,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:03:02,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:02,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:03:02,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:03:02,600 INFO L87 Difference]: Start difference. First operand has 153 states, 80 states have (on average 2.1125) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:02,765 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2022-07-20 06:03:02,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:03:02,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 06:03:02,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:02,788 INFO L225 Difference]: With dead ends: 154 [2022-07-20 06:03:02,788 INFO L226 Difference]: Without dead ends: 150 [2022-07-20 06:03:02,790 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-20 06:03:02,807 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:02,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 87 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:02,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-20 06:03:02,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2022-07-20 06:03:02,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 82 states have (on average 1.9024390243902438) internal successors, (156), 143 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2022-07-20 06:03:02,880 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 3 [2022-07-20 06:03:02,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:02,880 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2022-07-20 06:03:02,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2022-07-20 06:03:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:03:02,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:02,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:03:02,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:03:02,882 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:02,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:02,883 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 06:03:02,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:02,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545243862] [2022-07-20 06:03:02,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:02,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:02,949 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-20 06:03:02,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:02,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545243862] [2022-07-20 06:03:02,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545243862] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:02,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:02,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:03:02,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972661256] [2022-07-20 06:03:02,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:02,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:03:02,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:02,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:03:02,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:03:02,967 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:03,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:03,082 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2022-07-20 06:03:03,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:03:03,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 06:03:03,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:03,084 INFO L225 Difference]: With dead ends: 139 [2022-07-20 06:03:03,084 INFO L226 Difference]: Without dead ends: 139 [2022-07-20 06:03:03,084 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-20 06:03:03,085 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 113 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:03,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 100 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:03,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-20 06:03:03,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2022-07-20 06:03:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 82 states have (on average 1.7926829268292683) internal successors, (147), 134 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2022-07-20 06:03:03,114 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 3 [2022-07-20 06:03:03,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:03,115 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2022-07-20 06:03:03,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2022-07-20 06:03:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 06:03:03,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:03,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:03,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:03:03,120 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:03,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:03,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656077, now seen corresponding path program 1 times [2022-07-20 06:03:03,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:03,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716477826] [2022-07-20 06:03:03,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:03,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:03,279 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-20 06:03:03,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:03,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716477826] [2022-07-20 06:03:03,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716477826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:03,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:03,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:03,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883852732] [2022-07-20 06:03:03,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:03,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:03:03,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:03,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:03:03,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:03,282 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:03,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:03,546 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2022-07-20 06:03:03,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:03:03,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 06:03:03,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:03,552 INFO L225 Difference]: With dead ends: 179 [2022-07-20 06:03:03,553 INFO L226 Difference]: Without dead ends: 179 [2022-07-20 06:03:03,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:03,559 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 51 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:03,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 330 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:03:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-20 06:03:03,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 134. [2022-07-20 06:03:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 82 states have (on average 1.7804878048780488) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2022-07-20 06:03:03,587 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 12 [2022-07-20 06:03:03,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:03,587 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-07-20 06:03:03,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-07-20 06:03:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 06:03:03,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:03,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:03,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:03:03,593 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:03,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:03,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656076, now seen corresponding path program 1 times [2022-07-20 06:03:03,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:03,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774907723] [2022-07-20 06:03:03,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:03,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:03,777 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-20 06:03:03,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:03,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774907723] [2022-07-20 06:03:03,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774907723] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:03,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:03,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:03,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076944090] [2022-07-20 06:03:03,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:03,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:03:03,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:03,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:03:03,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:03,780 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:03,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:03,980 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2022-07-20 06:03:03,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:03:03,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 06:03:03,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:03,982 INFO L225 Difference]: With dead ends: 133 [2022-07-20 06:03:03,982 INFO L226 Difference]: Without dead ends: 133 [2022-07-20 06:03:03,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:03,983 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:03,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 366 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:03:03,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-20 06:03:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-07-20 06:03:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.7682926829268293) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-07-20 06:03:03,988 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 12 [2022-07-20 06:03:03,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:03,988 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-07-20 06:03:03,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-07-20 06:03:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 06:03:03,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:03,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:03,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:03:03,990 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:03,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:03,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115696, now seen corresponding path program 1 times [2022-07-20 06:03:03,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:03,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717647690] [2022-07-20 06:03:03,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:03,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:04,127 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-20 06:03:04,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:04,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717647690] [2022-07-20 06:03:04,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717647690] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:04,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:04,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:03:04,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802198551] [2022-07-20 06:03:04,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:04,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:03:04,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:04,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:03:04,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:03:04,130 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:04,294 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-07-20 06:03:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:03:04,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 06:03:04,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:04,295 INFO L225 Difference]: With dead ends: 134 [2022-07-20 06:03:04,295 INFO L226 Difference]: Without dead ends: 134 [2022-07-20 06:03:04,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:04,309 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 183 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:04,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 75 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:03:04,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-20 06:03:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2022-07-20 06:03:04,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.6136363636363635) internal successors, (142), 124 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2022-07-20 06:03:04,345 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 13 [2022-07-20 06:03:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:04,346 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2022-07-20 06:03:04,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2022-07-20 06:03:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 06:03:04,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:04,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:04,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:03:04,347 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:04,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:04,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115697, now seen corresponding path program 1 times [2022-07-20 06:03:04,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:04,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461905858] [2022-07-20 06:03:04,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:04,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:04,465 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-20 06:03:04,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:04,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461905858] [2022-07-20 06:03:04,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461905858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:04,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:04,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:03:04,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666771772] [2022-07-20 06:03:04,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:04,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:03:04,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:04,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:03:04,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:03:04,474 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:04,624 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2022-07-20 06:03:04,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:03:04,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 06:03:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:04,625 INFO L225 Difference]: With dead ends: 182 [2022-07-20 06:03:04,626 INFO L226 Difference]: Without dead ends: 182 [2022-07-20 06:03:04,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:04,627 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 187 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:04,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 118 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-20 06:03:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 156. [2022-07-20 06:03:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 155 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2022-07-20 06:03:04,639 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 13 [2022-07-20 06:03:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:04,639 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2022-07-20 06:03:04,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2022-07-20 06:03:04,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:03:04,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:04,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:04,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 06:03:04,640 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash -288943149, now seen corresponding path program 1 times [2022-07-20 06:03:04,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:04,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899081152] [2022-07-20 06:03:04,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:04,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:04,679 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-20 06:03:04,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:04,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899081152] [2022-07-20 06:03:04,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899081152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:04,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:04,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:04,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499253771] [2022-07-20 06:03:04,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:04,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:03:04,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:04,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:03:04,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:04,681 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:04,794 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2022-07-20 06:03:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:03:04,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 06:03:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:04,796 INFO L225 Difference]: With dead ends: 155 [2022-07-20 06:03:04,796 INFO L226 Difference]: Without dead ends: 155 [2022-07-20 06:03:04,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:04,797 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 9 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:04,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 308 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:04,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-20 06:03:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-07-20 06:03:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 119 states have (on average 1.5210084033613445) internal successors, (181), 154 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2022-07-20 06:03:04,800 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 16 [2022-07-20 06:03:04,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:04,800 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2022-07-20 06:03:04,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2022-07-20 06:03:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:03:04,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:04,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:04,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 06:03:04,802 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:04,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:04,802 INFO L85 PathProgramCache]: Analyzing trace with hash -288943148, now seen corresponding path program 1 times [2022-07-20 06:03:04,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:04,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284616969] [2022-07-20 06:03:04,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:04,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:04,861 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-20 06:03:04,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:04,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284616969] [2022-07-20 06:03:04,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284616969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:04,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:04,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:04,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251044222] [2022-07-20 06:03:04,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:04,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:03:04,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:04,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:03:04,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:04,864 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:04,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:04,997 INFO L93 Difference]: Finished difference Result 154 states and 179 transitions. [2022-07-20 06:03:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:03:04,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 06:03:04,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:04,999 INFO L225 Difference]: With dead ends: 154 [2022-07-20 06:03:04,999 INFO L226 Difference]: Without dead ends: 154 [2022-07-20 06:03:04,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:05,000 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:05,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 299 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-20 06:03:05,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-07-20 06:03:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.504201680672269) internal successors, (179), 153 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2022-07-20 06:03:05,003 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 16 [2022-07-20 06:03:05,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:05,004 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2022-07-20 06:03:05,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2022-07-20 06:03:05,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 06:03:05,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:05,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:05,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 06:03:05,005 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:05,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:05,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1504363226, now seen corresponding path program 1 times [2022-07-20 06:03:05,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:05,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090400478] [2022-07-20 06:03:05,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:05,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:05,031 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-20 06:03:05,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:05,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090400478] [2022-07-20 06:03:05,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090400478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:05,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:05,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:05,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953978694] [2022-07-20 06:03:05,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:05,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:03:05,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:05,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:03:05,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:03:05,034 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:05,122 INFO L93 Difference]: Finished difference Result 173 states and 192 transitions. [2022-07-20 06:03:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:03:05,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 06:03:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:05,123 INFO L225 Difference]: With dead ends: 173 [2022-07-20 06:03:05,124 INFO L226 Difference]: Without dead ends: 173 [2022-07-20 06:03:05,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:05,124 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 174 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:05,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 168 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:05,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-20 06:03:05,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2022-07-20 06:03:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.4873949579831933) internal successors, (177), 153 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2022-07-20 06:03:05,127 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 18 [2022-07-20 06:03:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:05,128 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2022-07-20 06:03:05,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:05,128 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2022-07-20 06:03:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 06:03:05,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:05,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:05,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 06:03:05,129 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:05,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:05,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1253394517, now seen corresponding path program 1 times [2022-07-20 06:03:05,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:05,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699661703] [2022-07-20 06:03:05,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:05,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:05,196 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-20 06:03:05,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:05,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699661703] [2022-07-20 06:03:05,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699661703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:05,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:05,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:03:05,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68929796] [2022-07-20 06:03:05,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:05,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:03:05,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:05,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:03:05,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:03:05,198 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:05,457 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2022-07-20 06:03:05,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:03:05,457 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 06:03:05,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:05,458 INFO L225 Difference]: With dead ends: 155 [2022-07-20 06:03:05,458 INFO L226 Difference]: Without dead ends: 155 [2022-07-20 06:03:05,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:03:05,458 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 172 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:05,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 257 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:03:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-20 06:03:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2022-07-20 06:03:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 152 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2022-07-20 06:03:05,461 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 20 [2022-07-20 06:03:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:05,461 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2022-07-20 06:03:05,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2022-07-20 06:03:05,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 06:03:05,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:05,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:05,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 06:03:05,462 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:05,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1253394518, now seen corresponding path program 1 times [2022-07-20 06:03:05,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:05,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277240358] [2022-07-20 06:03:05,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:05,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:05,559 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-20 06:03:05,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:05,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277240358] [2022-07-20 06:03:05,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277240358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:05,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:05,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:03:05,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814416109] [2022-07-20 06:03:05,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:05,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:03:05,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:05,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:03:05,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:03:05,561 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:06,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:06,006 INFO L93 Difference]: Finished difference Result 146 states and 167 transitions. [2022-07-20 06:03:06,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:03:06,006 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 06:03:06,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:06,007 INFO L225 Difference]: With dead ends: 146 [2022-07-20 06:03:06,007 INFO L226 Difference]: Without dead ends: 146 [2022-07-20 06:03:06,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-07-20 06:03:06,007 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 173 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:06,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 264 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:03:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-20 06:03:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 134. [2022-07-20 06:03:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 111 states have (on average 1.4054054054054055) internal successors, (156), 133 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2022-07-20 06:03:06,010 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 20 [2022-07-20 06:03:06,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:06,010 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2022-07-20 06:03:06,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2022-07-20 06:03:06,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 06:03:06,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:06,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:03:06,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 06:03:06,011 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:06,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1737058081, now seen corresponding path program 1 times [2022-07-20 06:03:06,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:06,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715535866] [2022-07-20 06:03:06,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:06,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:06,066 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-20 06:03:06,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:06,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715535866] [2022-07-20 06:03:06,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715535866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:06,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:06,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:06,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55955157] [2022-07-20 06:03:06,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:06,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:03:06,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:06,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:03:06,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:03:06,068 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:06,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:06,099 INFO L93 Difference]: Finished difference Result 160 states and 190 transitions. [2022-07-20 06:03:06,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:03:06,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 06:03:06,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:06,101 INFO L225 Difference]: With dead ends: 160 [2022-07-20 06:03:06,101 INFO L226 Difference]: Without dead ends: 160 [2022-07-20 06:03:06,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:06,102 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 21 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:06,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 316 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:03:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-20 06:03:06,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 138. [2022-07-20 06:03:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 115 states have (on average 1.391304347826087) internal successors, (160), 137 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 160 transitions. [2022-07-20 06:03:06,117 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 160 transitions. Word has length 21 [2022-07-20 06:03:06,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:06,118 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 160 transitions. [2022-07-20 06:03:06,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 160 transitions. [2022-07-20 06:03:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:03:06,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:06,121 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:03:06,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 06:03:06,122 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:06,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:06,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1420838518, now seen corresponding path program 1 times [2022-07-20 06:03:06,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:06,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477242619] [2022-07-20 06:03:06,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:06,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:06,183 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-20 06:03:06,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:06,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477242619] [2022-07-20 06:03:06,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477242619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:06,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:06,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:03:06,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341299113] [2022-07-20 06:03:06,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:06,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:03:06,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:06,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:03:06,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:03:06,186 INFO L87 Difference]: Start difference. First operand 138 states and 160 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:06,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:06,192 INFO L93 Difference]: Finished difference Result 140 states and 162 transitions. [2022-07-20 06:03:06,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:03:06,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 06:03:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:06,193 INFO L225 Difference]: With dead ends: 140 [2022-07-20 06:03:06,193 INFO L226 Difference]: Without dead ends: 140 [2022-07-20 06:03:06,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:03:06,195 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:06,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:03:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-20 06:03:06,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-07-20 06:03:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 139 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2022-07-20 06:03:06,211 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 23 [2022-07-20 06:03:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:06,212 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2022-07-20 06:03:06,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2022-07-20 06:03:06,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:03:06,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:06,212 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:03:06,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 06:03:06,213 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:06,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1628462334, now seen corresponding path program 1 times [2022-07-20 06:03:06,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:06,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712444644] [2022-07-20 06:03:06,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:06,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:06,340 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-20 06:03:06,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:06,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712444644] [2022-07-20 06:03:06,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712444644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:06,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:06,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:03:06,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764284553] [2022-07-20 06:03:06,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:06,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:03:06,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:06,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:03:06,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:06,342 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:06,625 INFO L93 Difference]: Finished difference Result 269 states and 312 transitions. [2022-07-20 06:03:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:03:06,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 06:03:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:06,627 INFO L225 Difference]: With dead ends: 269 [2022-07-20 06:03:06,627 INFO L226 Difference]: Without dead ends: 269 [2022-07-20 06:03:06,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:03:06,627 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 165 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:06,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 334 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:03:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-20 06:03:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 154. [2022-07-20 06:03:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 153 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2022-07-20 06:03:06,630 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 23 [2022-07-20 06:03:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:06,630 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2022-07-20 06:03:06,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2022-07-20 06:03:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:03:06,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:06,631 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:03:06,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 06:03:06,634 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:06,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:06,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1628462335, now seen corresponding path program 1 times [2022-07-20 06:03:06,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:06,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357005012] [2022-07-20 06:03:06,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:06,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:06,733 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-20 06:03:06,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:06,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357005012] [2022-07-20 06:03:06,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357005012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:06,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:06,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:03:06,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717116472] [2022-07-20 06:03:06,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:06,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:03:06,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:06,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:03:06,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:06,736 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:07,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:07,145 INFO L93 Difference]: Finished difference Result 279 states and 325 transitions. [2022-07-20 06:03:07,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:03:07,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 06:03:07,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:07,146 INFO L225 Difference]: With dead ends: 279 [2022-07-20 06:03:07,146 INFO L226 Difference]: Without dead ends: 279 [2022-07-20 06:03:07,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-07-20 06:03:07,147 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 164 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:07,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 469 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:03:07,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-20 06:03:07,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 150. [2022-07-20 06:03:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 149 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2022-07-20 06:03:07,150 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 23 [2022-07-20 06:03:07,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:07,150 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2022-07-20 06:03:07,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2022-07-20 06:03:07,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:03:07,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:07,150 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:03:07,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 06:03:07,151 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:07,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:07,154 INFO L85 PathProgramCache]: Analyzing trace with hash 375423567, now seen corresponding path program 1 times [2022-07-20 06:03:07,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:07,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137935642] [2022-07-20 06:03:07,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:07,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:07,260 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-20 06:03:07,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:07,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137935642] [2022-07-20 06:03:07,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137935642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:07,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:07,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:03:07,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296096474] [2022-07-20 06:03:07,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:07,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:03:07,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:07,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:03:07,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:07,280 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:07,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:07,602 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2022-07-20 06:03:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:03:07,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 06:03:07,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:07,603 INFO L225 Difference]: With dead ends: 225 [2022-07-20 06:03:07,603 INFO L226 Difference]: Without dead ends: 225 [2022-07-20 06:03:07,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:03:07,604 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 229 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:07,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 360 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:03:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-07-20 06:03:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 156. [2022-07-20 06:03:07,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 133 states have (on average 1.3609022556390977) internal successors, (181), 155 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 181 transitions. [2022-07-20 06:03:07,606 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 181 transitions. Word has length 25 [2022-07-20 06:03:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:07,606 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 181 transitions. [2022-07-20 06:03:07,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 181 transitions. [2022-07-20 06:03:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:03:07,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:07,607 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:03:07,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 06:03:07,608 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:07,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:07,609 INFO L85 PathProgramCache]: Analyzing trace with hash 729704446, now seen corresponding path program 1 times [2022-07-20 06:03:07,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:07,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098646466] [2022-07-20 06:03:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:07,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:07,731 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-20 06:03:07,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:07,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098646466] [2022-07-20 06:03:07,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098646466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:07,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:07,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:03:07,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195790878] [2022-07-20 06:03:07,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:07,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:03:07,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:07,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:03:07,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:03:07,733 INFO L87 Difference]: Start difference. First operand 156 states and 181 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:08,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:08,259 INFO L93 Difference]: Finished difference Result 318 states and 365 transitions. [2022-07-20 06:03:08,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:03:08,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 06:03:08,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:08,261 INFO L225 Difference]: With dead ends: 318 [2022-07-20 06:03:08,261 INFO L226 Difference]: Without dead ends: 318 [2022-07-20 06:03:08,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:03:08,261 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 353 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:08,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 459 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:03:08,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-07-20 06:03:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 169. [2022-07-20 06:03:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 146 states have (on average 1.356164383561644) internal successors, (198), 168 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2022-07-20 06:03:08,267 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 27 [2022-07-20 06:03:08,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:08,268 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2022-07-20 06:03:08,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2022-07-20 06:03:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:03:08,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:08,270 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:03:08,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 06:03:08,270 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:08,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:08,271 INFO L85 PathProgramCache]: Analyzing trace with hash 729704447, now seen corresponding path program 1 times [2022-07-20 06:03:08,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:08,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565812054] [2022-07-20 06:03:08,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:08,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:08,478 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-20 06:03:08,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:08,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565812054] [2022-07-20 06:03:08,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565812054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:08,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:08,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:03:08,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390992197] [2022-07-20 06:03:08,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:08,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:03:08,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:08,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:03:08,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:03:08,480 INFO L87 Difference]: Start difference. First operand 169 states and 198 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:09,062 INFO L93 Difference]: Finished difference Result 251 states and 287 transitions. [2022-07-20 06:03:09,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:03:09,062 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 06:03:09,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:09,063 INFO L225 Difference]: With dead ends: 251 [2022-07-20 06:03:09,063 INFO L226 Difference]: Without dead ends: 251 [2022-07-20 06:03:09,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-20 06:03:09,063 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 280 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:09,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 458 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:03:09,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-20 06:03:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 169. [2022-07-20 06:03:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 168 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2022-07-20 06:03:09,066 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 27 [2022-07-20 06:03:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:09,066 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2022-07-20 06:03:09,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:09,067 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2022-07-20 06:03:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:03:09,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:09,068 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:03:09,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 06:03:09,069 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:09,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:09,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1443803627, now seen corresponding path program 1 times [2022-07-20 06:03:09,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:09,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395548330] [2022-07-20 06:03:09,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:09,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:09,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:09,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395548330] [2022-07-20 06:03:09,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395548330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:09,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:09,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:09,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220841184] [2022-07-20 06:03:09,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:09,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:03:09,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:09,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:03:09,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:03:09,110 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:09,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:09,123 INFO L93 Difference]: Finished difference Result 181 states and 210 transitions. [2022-07-20 06:03:09,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:03:09,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 06:03:09,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:09,124 INFO L225 Difference]: With dead ends: 181 [2022-07-20 06:03:09,125 INFO L226 Difference]: Without dead ends: 181 [2022-07-20 06:03:09,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:09,125 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 10 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:09,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 317 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:03:09,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-20 06:03:09,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 173. [2022-07-20 06:03:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 172 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 200 transitions. [2022-07-20 06:03:09,144 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 200 transitions. Word has length 27 [2022-07-20 06:03:09,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:09,144 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 200 transitions. [2022-07-20 06:03:09,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:09,144 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 200 transitions. [2022-07-20 06:03:09,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:03:09,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:09,145 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:03:09,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 06:03:09,146 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:09,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:09,146 INFO L85 PathProgramCache]: Analyzing trace with hash 17756513, now seen corresponding path program 1 times [2022-07-20 06:03:09,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:09,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527401941] [2022-07-20 06:03:09,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:09,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:09,212 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-20 06:03:09,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:09,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527401941] [2022-07-20 06:03:09,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527401941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:09,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:09,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:09,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543644446] [2022-07-20 06:03:09,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:09,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:03:09,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:09,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:03:09,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:09,214 INFO L87 Difference]: Start difference. First operand 173 states and 200 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:09,362 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2022-07-20 06:03:09,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:03:09,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-20 06:03:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:09,363 INFO L225 Difference]: With dead ends: 182 [2022-07-20 06:03:09,363 INFO L226 Difference]: Without dead ends: 182 [2022-07-20 06:03:09,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:09,363 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 10 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:09,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 296 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-20 06:03:09,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2022-07-20 06:03:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.3266666666666667) internal successors, (199), 171 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 199 transitions. [2022-07-20 06:03:09,366 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 199 transitions. Word has length 28 [2022-07-20 06:03:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:09,366 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 199 transitions. [2022-07-20 06:03:09,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 199 transitions. [2022-07-20 06:03:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:03:09,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:09,366 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:03:09,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 06:03:09,366 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:09,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:09,367 INFO L85 PathProgramCache]: Analyzing trace with hash 17756514, now seen corresponding path program 1 times [2022-07-20 06:03:09,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:09,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856894411] [2022-07-20 06:03:09,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:09,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:09,453 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-20 06:03:09,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:09,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856894411] [2022-07-20 06:03:09,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856894411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:09,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:09,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:03:09,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559161305] [2022-07-20 06:03:09,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:09,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:03:09,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:09,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:03:09,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:09,456 INFO L87 Difference]: Start difference. First operand 172 states and 199 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:09,613 INFO L93 Difference]: Finished difference Result 171 states and 198 transitions. [2022-07-20 06:03:09,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:03:09,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-20 06:03:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:09,614 INFO L225 Difference]: With dead ends: 171 [2022-07-20 06:03:09,614 INFO L226 Difference]: Without dead ends: 171 [2022-07-20 06:03:09,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:09,614 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 2 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:09,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 282 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:09,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-20 06:03:09,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-20 06:03:09,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.32) internal successors, (198), 170 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2022-07-20 06:03:09,617 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 28 [2022-07-20 06:03:09,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:09,617 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2022-07-20 06:03:09,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2022-07-20 06:03:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:03:09,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:09,617 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:03:09,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 06:03:09,618 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:09,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:09,618 INFO L85 PathProgramCache]: Analyzing trace with hash -42480305, now seen corresponding path program 1 times [2022-07-20 06:03:09,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:09,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126361725] [2022-07-20 06:03:09,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:09,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:09,750 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-20 06:03:09,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:09,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126361725] [2022-07-20 06:03:09,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126361725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:09,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:09,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:03:09,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521474679] [2022-07-20 06:03:09,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:09,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:03:09,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:09,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:03:09,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:03:09,752 INFO L87 Difference]: Start difference. First operand 171 states and 198 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:10,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:10,357 INFO L93 Difference]: Finished difference Result 251 states and 281 transitions. [2022-07-20 06:03:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:03:10,360 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 06:03:10,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:10,361 INFO L225 Difference]: With dead ends: 251 [2022-07-20 06:03:10,361 INFO L226 Difference]: Without dead ends: 251 [2022-07-20 06:03:10,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:03:10,362 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 267 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:10,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 692 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 06:03:10,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-20 06:03:10,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 171. [2022-07-20 06:03:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.3133333333333332) internal successors, (197), 170 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 197 transitions. [2022-07-20 06:03:10,364 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 197 transitions. Word has length 29 [2022-07-20 06:03:10,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:10,364 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 197 transitions. [2022-07-20 06:03:10,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:10,365 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 197 transitions. [2022-07-20 06:03:10,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:03:10,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:10,365 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:03:10,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 06:03:10,365 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:10,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:10,365 INFO L85 PathProgramCache]: Analyzing trace with hash 439757914, now seen corresponding path program 1 times [2022-07-20 06:03:10,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:10,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615603108] [2022-07-20 06:03:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:10,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:10,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:10,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615603108] [2022-07-20 06:03:10,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615603108] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:10,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146111467] [2022-07-20 06:03:10,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:10,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:10,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:10,463 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-20 06:03:10,562 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-20 06:03:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:10,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-20 06:03:10,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:10,674 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-20 06:03:10,694 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-20 06:03:10,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:10,724 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 21 treesize of output 20 [2022-07-20 06:03:10,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:10,744 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 21 treesize of output 20 [2022-07-20 06:03:10,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:10,777 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 21 treesize of output 20 [2022-07-20 06:03:10,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:10,796 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 21 treesize of output 20 [2022-07-20 06:03:10,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:10,808 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 21 treesize of output 20 [2022-07-20 06:03:10,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:10,815 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 21 treesize of output 20 [2022-07-20 06:03:10,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:10,974 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:03:10,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:10,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:10,997 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 15 treesize of output 10 [2022-07-20 06:03:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:11,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:25,514 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 23 [2022-07-20 06:03:25,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:25,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:25,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:25,520 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 14 treesize of output 12 [2022-07-20 06:03:25,529 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 23 [2022-07-20 06:03:25,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:25,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:25,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:25,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:25,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146111467] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:25,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:25,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 10] total 15 [2022-07-20 06:03:25,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145530280] [2022-07-20 06:03:25,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:25,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 06:03:25,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:25,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 06:03:25,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=161, Unknown=9, NotChecked=0, Total=210 [2022-07-20 06:03:25,550 INFO L87 Difference]: Start difference. First operand 171 states and 197 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:25,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:25,774 INFO L93 Difference]: Finished difference Result 194 states and 222 transitions. [2022-07-20 06:03:25,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:03:25,774 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 06:03:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:25,775 INFO L225 Difference]: With dead ends: 194 [2022-07-20 06:03:25,775 INFO L226 Difference]: Without dead ends: 194 [2022-07-20 06:03:25,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=66, Invalid=231, Unknown=9, NotChecked=0, Total=306 [2022-07-20 06:03:25,776 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 79 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:25,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 638 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 154 Invalid, 0 Unknown, 55 Unchecked, 0.2s Time] [2022-07-20 06:03:25,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-20 06:03:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2022-07-20 06:03:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 171 states have (on average 1.286549707602339) internal successors, (220), 191 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 220 transitions. [2022-07-20 06:03:25,778 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 220 transitions. Word has length 29 [2022-07-20 06:03:25,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:25,778 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 220 transitions. [2022-07-20 06:03:25,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 220 transitions. [2022-07-20 06:03:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:03:25,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:25,779 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:03:25,815 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-20 06:03:25,992 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,SelfDestructingSolverStorable22 [2022-07-20 06:03:25,992 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:25,992 INFO L85 PathProgramCache]: Analyzing trace with hash 79198050, now seen corresponding path program 1 times [2022-07-20 06:03:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:25,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115459157] [2022-07-20 06:03:25,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:26,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:26,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:26,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115459157] [2022-07-20 06:03:26,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115459157] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:26,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769959605] [2022-07-20 06:03:26,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:26,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:26,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:26,084 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-20 06:03:26,088 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-20 06:03:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:26,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-20 06:03:26,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:26,201 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-20 06:03:26,204 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-20 06:03:26,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:26,231 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 21 treesize of output 20 [2022-07-20 06:03:26,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:26,236 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 21 treesize of output 20 [2022-07-20 06:03:26,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:26,270 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 21 treesize of output 20 [2022-07-20 06:03:26,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:26,281 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 21 treesize of output 20 [2022-07-20 06:03:26,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:26,297 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 21 treesize of output 20 [2022-07-20 06:03:26,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:26,304 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 21 treesize of output 20 [2022-07-20 06:03:26,407 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:26,407 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:03:26,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:26,412 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:26,412 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 15 treesize of output 10 [2022-07-20 06:03:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:26,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:43,179 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 23 [2022-07-20 06:03:43,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:43,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:43,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:43,185 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 14 treesize of output 12 [2022-07-20 06:03:43,192 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 23 [2022-07-20 06:03:43,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:43,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:43,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:43,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:43,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769959605] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:43,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:43,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 10] total 15 [2022-07-20 06:03:43,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952216037] [2022-07-20 06:03:43,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:43,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 06:03:43,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:43,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 06:03:43,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=159, Unknown=11, NotChecked=0, Total=210 [2022-07-20 06:03:43,217 INFO L87 Difference]: Start difference. First operand 192 states and 220 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:43,508 INFO L93 Difference]: Finished difference Result 233 states and 264 transitions. [2022-07-20 06:03:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:03:43,509 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 06:03:43,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:43,510 INFO L225 Difference]: With dead ends: 233 [2022-07-20 06:03:43,510 INFO L226 Difference]: Without dead ends: 233 [2022-07-20 06:03:43,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=119, Invalid=332, Unknown=11, NotChecked=0, Total=462 [2022-07-20 06:03:43,510 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 315 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:43,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 627 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 341 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2022-07-20 06:03:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-20 06:03:43,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 184. [2022-07-20 06:03:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 163 states have (on average 1.3006134969325154) internal successors, (212), 183 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 212 transitions. [2022-07-20 06:03:43,513 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 212 transitions. Word has length 29 [2022-07-20 06:03:43,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:43,513 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 212 transitions. [2022-07-20 06:03:43,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:43,513 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 212 transitions. [2022-07-20 06:03:43,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:03:43,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:43,514 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:03:43,548 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-20 06:03:43,723 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,SelfDestructingSolverStorable23 [2022-07-20 06:03:43,723 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:43,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:43,724 INFO L85 PathProgramCache]: Analyzing trace with hash -469775188, now seen corresponding path program 1 times [2022-07-20 06:03:43,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:43,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564468290] [2022-07-20 06:03:43,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:43,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:43,814 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-20 06:03:43,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:43,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564468290] [2022-07-20 06:03:43,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564468290] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:43,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:43,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:03:43,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047252456] [2022-07-20 06:03:43,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:43,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:03:43,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:43,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:03:43,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:03:43,817 INFO L87 Difference]: Start difference. First operand 184 states and 212 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:44,061 INFO L93 Difference]: Finished difference Result 232 states and 263 transitions. [2022-07-20 06:03:44,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:03:44,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-20 06:03:44,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:44,062 INFO L225 Difference]: With dead ends: 232 [2022-07-20 06:03:44,062 INFO L226 Difference]: Without dead ends: 232 [2022-07-20 06:03:44,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:03:44,062 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 62 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:44,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 507 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:03:44,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-20 06:03:44,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 190. [2022-07-20 06:03:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.2958579881656804) internal successors, (219), 189 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 219 transitions. [2022-07-20 06:03:44,065 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 219 transitions. Word has length 31 [2022-07-20 06:03:44,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:44,065 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 219 transitions. [2022-07-20 06:03:44,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:44,065 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 219 transitions. [2022-07-20 06:03:44,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:03:44,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:44,066 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:03:44,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 06:03:44,066 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:44,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:44,066 INFO L85 PathProgramCache]: Analyzing trace with hash 605010984, now seen corresponding path program 1 times [2022-07-20 06:03:44,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:44,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578979832] [2022-07-20 06:03:44,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:44,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:44,165 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-20 06:03:44,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:44,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578979832] [2022-07-20 06:03:44,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578979832] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:44,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:44,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 06:03:44,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669749707] [2022-07-20 06:03:44,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:44,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 06:03:44,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:44,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 06:03:44,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:03:44,167 INFO L87 Difference]: Start difference. First operand 190 states and 219 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:44,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:44,698 INFO L93 Difference]: Finished difference Result 228 states and 254 transitions. [2022-07-20 06:03:44,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 06:03:44,699 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:03:44,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:44,700 INFO L225 Difference]: With dead ends: 228 [2022-07-20 06:03:44,700 INFO L226 Difference]: Without dead ends: 228 [2022-07-20 06:03:44,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2022-07-20 06:03:44,700 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 190 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:44,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 743 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:03:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-20 06:03:44,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 187. [2022-07-20 06:03:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 186 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 214 transitions. [2022-07-20 06:03:44,703 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 214 transitions. Word has length 34 [2022-07-20 06:03:44,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:44,703 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 214 transitions. [2022-07-20 06:03:44,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:44,703 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2022-07-20 06:03:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:03:44,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:44,704 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:03:44,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-20 06:03:44,704 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:44,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:44,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1443725027, now seen corresponding path program 1 times [2022-07-20 06:03:44,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:44,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87854524] [2022-07-20 06:03:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:44,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:03:44,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:44,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87854524] [2022-07-20 06:03:44,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87854524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:44,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:44,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:03:44,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458540782] [2022-07-20 06:03:44,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:44,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:03:44,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:44,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:03:44,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:03:44,751 INFO L87 Difference]: Start difference. First operand 187 states and 214 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:44,906 INFO L93 Difference]: Finished difference Result 234 states and 265 transitions. [2022-07-20 06:03:44,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:03:44,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 06:03:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:44,907 INFO L225 Difference]: With dead ends: 234 [2022-07-20 06:03:44,907 INFO L226 Difference]: Without dead ends: 234 [2022-07-20 06:03:44,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:03:44,908 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 182 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:44,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 335 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-20 06:03:44,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 204. [2022-07-20 06:03:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.2677595628415301) internal successors, (232), 203 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2022-07-20 06:03:44,911 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 36 [2022-07-20 06:03:44,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:44,911 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2022-07-20 06:03:44,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:44,911 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2022-07-20 06:03:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:03:44,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:44,911 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:03:44,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 06:03:44,911 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:44,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1443714042, now seen corresponding path program 1 times [2022-07-20 06:03:44,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:44,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625365329] [2022-07-20 06:03:44,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:44,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:03:44,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:44,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625365329] [2022-07-20 06:03:44,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625365329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:03:44,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:03:44,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:03:44,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018771105] [2022-07-20 06:03:44,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:03:44,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:03:44,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:44,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:03:44,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:03:44,984 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:45,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:45,071 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2022-07-20 06:03:45,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:03:45,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 06:03:45,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:45,072 INFO L225 Difference]: With dead ends: 221 [2022-07-20 06:03:45,072 INFO L226 Difference]: Without dead ends: 221 [2022-07-20 06:03:45,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:03:45,073 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 124 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:45,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 136 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:03:45,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-20 06:03:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 206. [2022-07-20 06:03:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.2648648648648648) internal successors, (234), 205 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 234 transitions. [2022-07-20 06:03:45,075 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 234 transitions. Word has length 36 [2022-07-20 06:03:45,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:45,075 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 234 transitions. [2022-07-20 06:03:45,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:45,075 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 234 transitions. [2022-07-20 06:03:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 06:03:45,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:45,076 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:03:45,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-20 06:03:45,076 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:45,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1805802628, now seen corresponding path program 1 times [2022-07-20 06:03:45,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:45,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118747539] [2022-07-20 06:03:45,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:45,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:45,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:45,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118747539] [2022-07-20 06:03:45,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118747539] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:45,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171166449] [2022-07-20 06:03:45,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:45,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:45,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:45,235 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-20 06:03:45,236 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-20 06:03:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:45,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 06:03:45,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:45,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:45,648 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-20 06:03:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:45,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:45,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:45,835 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 20 treesize of output 23 [2022-07-20 06:03:46,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:46,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171166449] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:46,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:46,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 29 [2022-07-20 06:03:46,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633917328] [2022-07-20 06:03:46,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:46,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 06:03:46,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:46,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 06:03:46,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2022-07-20 06:03:46,058 INFO L87 Difference]: Start difference. First operand 206 states and 234 transitions. Second operand has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:46,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:46,903 INFO L93 Difference]: Finished difference Result 300 states and 332 transitions. [2022-07-20 06:03:46,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 06:03:46,903 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-20 06:03:46,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:46,904 INFO L225 Difference]: With dead ends: 300 [2022-07-20 06:03:46,904 INFO L226 Difference]: Without dead ends: 300 [2022-07-20 06:03:46,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=389, Invalid=1773, Unknown=0, NotChecked=0, Total=2162 [2022-07-20 06:03:46,905 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 594 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 345 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:46,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 911 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 755 Invalid, 0 Unknown, 345 Unchecked, 0.4s Time] [2022-07-20 06:03:46,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-07-20 06:03:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 230. [2022-07-20 06:03:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 209 states have (on average 1.2535885167464116) internal successors, (262), 229 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 262 transitions. [2022-07-20 06:03:46,908 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 262 transitions. Word has length 37 [2022-07-20 06:03:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:46,908 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 262 transitions. [2022-07-20 06:03:46,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 262 transitions. [2022-07-20 06:03:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:03:46,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:46,908 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:03:46,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-20 06:03:47,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-20 06:03:47,109 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:47,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:47,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1898858598, now seen corresponding path program 1 times [2022-07-20 06:03:47,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:47,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059600109] [2022-07-20 06:03:47,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:47,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:47,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:47,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059600109] [2022-07-20 06:03:47,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059600109] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:47,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921599752] [2022-07-20 06:03:47,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:47,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:47,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:47,401 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-20 06:03:47,402 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-20 06:03:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:47,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-20 06:03:47,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:47,525 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-20 06:03:47,564 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-20 06:03:47,570 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-20 06:03:47,645 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:03:47,646 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-20 06:03:47,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:47,672 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 21 treesize of output 20 [2022-07-20 06:03:47,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:47,680 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 21 treesize of output 20 [2022-07-20 06:03:47,762 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:47,762 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:03:47,766 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 20 treesize of output 22 [2022-07-20 06:03:47,882 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:03:47,883 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 16 treesize of output 22 [2022-07-20 06:03:47,887 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 7 treesize of output 3 [2022-07-20 06:03:47,898 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:47,898 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 29 [2022-07-20 06:03:47,975 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:47,975 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 29 [2022-07-20 06:03:47,990 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:03:47,990 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 16 treesize of output 22 [2022-07-20 06:03:48,000 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 7 treesize of output 3 [2022-07-20 06:03:48,042 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:48,043 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 38 treesize of output 37 [2022-07-20 06:03:48,047 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 20 treesize of output 22 [2022-07-20 06:03:48,291 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 7 [2022-07-20 06:03:48,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:48,296 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:48,297 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 27 treesize of output 11 [2022-07-20 06:03:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:48,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:48,464 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1109 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1109) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1110 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:03:48,499 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1110 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1109 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1109) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2022-07-20 06:03:48,505 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1109 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1109) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1110 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:03:48,540 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1104 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1104))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1109)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2022-07-20 06:03:48,549 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1104 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1104))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1109)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1104) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1110)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:03:48,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:48,969 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:48,970 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 48 treesize of output 54 [2022-07-20 06:03:48,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:48,992 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:48,993 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 35 treesize of output 41 [2022-07-20 06:03:48,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:48,998 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 64 treesize of output 50 [2022-07-20 06:03:49,001 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 188 treesize of output 164 [2022-07-20 06:03:49,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 57 treesize of output 49 [2022-07-20 06:03:49,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 106 treesize of output 90 [2022-07-20 06:03:49,016 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 90 treesize of output 78 [2022-07-20 06:03:49,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:49,044 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-20 06:03:49,044 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 48 treesize of output 1 [2022-07-20 06:03:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:49,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921599752] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:49,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:49,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 16] total 39 [2022-07-20 06:03:49,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128623231] [2022-07-20 06:03:49,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:49,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-20 06:03:49,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:49,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-20 06:03:49,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=979, Unknown=21, NotChecked=340, Total=1482 [2022-07-20 06:03:49,092 INFO L87 Difference]: Start difference. First operand 230 states and 262 transitions. Second operand has 39 states, 39 states have (on average 2.641025641025641) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:50,571 INFO L93 Difference]: Finished difference Result 326 states and 365 transitions. [2022-07-20 06:03:50,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 06:03:50,572 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.641025641025641) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 06:03:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:50,573 INFO L225 Difference]: With dead ends: 326 [2022-07-20 06:03:50,573 INFO L226 Difference]: Without dead ends: 326 [2022-07-20 06:03:50,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=398, Invalid=2247, Unknown=27, NotChecked=520, Total=3192 [2022-07-20 06:03:50,574 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 206 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 975 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:50,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1427 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 712 Invalid, 0 Unknown, 975 Unchecked, 0.5s Time] [2022-07-20 06:03:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-07-20 06:03:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 257. [2022-07-20 06:03:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 236 states have (on average 1.2457627118644068) internal successors, (294), 256 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 294 transitions. [2022-07-20 06:03:50,577 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 294 transitions. Word has length 38 [2022-07-20 06:03:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:50,577 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 294 transitions. [2022-07-20 06:03:50,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.641025641025641) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 294 transitions. [2022-07-20 06:03:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:03:50,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:50,578 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:03:50,637 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-20 06:03:50,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:50,779 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:50,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:50,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1535563358, now seen corresponding path program 1 times [2022-07-20 06:03:50,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:50,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001454620] [2022-07-20 06:03:50,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:50,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:51,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:51,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001454620] [2022-07-20 06:03:51,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001454620] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:51,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109087462] [2022-07-20 06:03:51,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:51,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:51,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:51,140 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-20 06:03:51,155 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-20 06:03:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:51,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-20 06:03:51,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:51,328 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-20 06:03:51,349 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-20 06:03:51,352 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-20 06:03:51,454 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:03:51,454 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-20 06:03:51,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:51,500 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 21 treesize of output 20 [2022-07-20 06:03:51,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:51,513 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 21 treesize of output 20 [2022-07-20 06:03:51,637 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:51,637 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:03:51,642 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 20 treesize of output 22 [2022-07-20 06:03:51,773 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:51,773 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 29 [2022-07-20 06:03:51,812 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:03:51,812 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 16 treesize of output 22 [2022-07-20 06:03:51,817 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 7 treesize of output 3 [2022-07-20 06:03:51,897 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:51,898 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 29 [2022-07-20 06:03:51,924 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:03:51,924 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 16 treesize of output 22 [2022-07-20 06:03:51,930 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 7 treesize of output 3 [2022-07-20 06:03:51,988 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:51,988 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 38 treesize of output 37 [2022-07-20 06:03:51,991 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 20 treesize of output 22 [2022-07-20 06:03:52,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:03:52,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:52,159 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 27 treesize of output 11 [2022-07-20 06:03:52,163 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 7 [2022-07-20 06:03:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:52,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:52,374 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1243 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1242 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2022-07-20 06:03:52,397 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1242 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2022-07-20 06:03:52,412 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1243) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1242 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:03:52,422 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1237) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1236) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1236))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1243)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2022-07-20 06:03:52,428 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1237) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1236) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1242)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1236))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1243)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2022-07-20 06:03:52,467 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1236))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1243)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1233 Int) (v_ArrVal_1242 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1233)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1237) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1236) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2022-07-20 06:03:52,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:52,758 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:52,759 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 48 treesize of output 54 [2022-07-20 06:03:52,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:52,766 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:52,766 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 35 treesize of output 41 [2022-07-20 06:03:52,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:52,771 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 64 treesize of output 50 [2022-07-20 06:03:52,773 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 188 treesize of output 164 [2022-07-20 06:03:52,778 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 114 treesize of output 106 [2022-07-20 06:03:52,781 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 106 treesize of output 94 [2022-07-20 06:03:52,789 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 94 treesize of output 78 [2022-07-20 06:03:52,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:52,824 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-20 06:03:52,825 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 48 treesize of output 1 [2022-07-20 06:03:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:52,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109087462] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:03:52,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:03:52,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 40 [2022-07-20 06:03:52,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666951761] [2022-07-20 06:03:52,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:03:52,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-20 06:03:52,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:03:52,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-20 06:03:52,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=998, Unknown=12, NotChecked=414, Total=1560 [2022-07-20 06:03:52,873 INFO L87 Difference]: Start difference. First operand 257 states and 294 transitions. Second operand has 40 states, 40 states have (on average 2.575) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:03:56,952 INFO L93 Difference]: Finished difference Result 388 states and 435 transitions. [2022-07-20 06:03:56,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-20 06:03:56,952 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.575) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 06:03:56,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:03:56,953 INFO L225 Difference]: With dead ends: 388 [2022-07-20 06:03:56,953 INFO L226 Difference]: Without dead ends: 388 [2022-07-20 06:03:56,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=596, Invalid=3195, Unknown=15, NotChecked=750, Total=4556 [2022-07-20 06:03:56,955 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 519 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1617 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:03:56,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1486 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1101 Invalid, 0 Unknown, 1617 Unchecked, 0.4s Time] [2022-07-20 06:03:56,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-07-20 06:03:56,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 270. [2022-07-20 06:03:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 249 states have (on average 1.2409638554216869) internal successors, (309), 269 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 309 transitions. [2022-07-20 06:03:56,958 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 309 transitions. Word has length 38 [2022-07-20 06:03:56,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:03:56,959 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 309 transitions. [2022-07-20 06:03:56,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.575) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:03:56,959 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 309 transitions. [2022-07-20 06:03:56,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:03:56,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:03:56,961 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:03:56,993 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-20 06:03:57,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:57,178 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:03:57,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:03:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1599858270, now seen corresponding path program 1 times [2022-07-20 06:03:57,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:03:57,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033203152] [2022-07-20 06:03:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:57,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:03:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:57,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:03:57,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033203152] [2022-07-20 06:03:57,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033203152] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:03:57,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066448643] [2022-07-20 06:03:57,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:03:57,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:03:57,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:03:57,417 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-20 06:03:57,418 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-20 06:03:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:03:57,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-20 06:03:57,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:03:57,550 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-20 06:03:57,566 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-20 06:03:57,573 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-20 06:03:57,667 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:03:57,667 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-20 06:03:57,720 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-20 06:03:57,721 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 1 case distinctions, treesize of input 21 treesize of output 26 [2022-07-20 06:03:57,739 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-20 06:03:57,740 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 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:03:57,861 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:57,861 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 50 [2022-07-20 06:03:57,865 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-20 06:03:58,035 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:58,035 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 80 treesize of output 70 [2022-07-20 06:03:58,046 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:58,047 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 85 treesize of output 85 [2022-07-20 06:03:58,182 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:58,183 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 80 treesize of output 70 [2022-07-20 06:03:58,192 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:58,192 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 85 treesize of output 85 [2022-07-20 06:03:58,248 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:58,248 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 80 treesize of output 70 [2022-07-20 06:03:58,256 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:03:58,257 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 85 treesize of output 85 [2022-07-20 06:03:58,471 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:58,471 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 76 treesize of output 70 [2022-07-20 06:03:58,842 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-20 06:03:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:03:58,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:03:59,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1376 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (and (= |c_ULTIMATE.start_main_~head~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1377) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (= (select |c_#valid| .cse0) 1))))) is different from false [2022-07-20 06:03:59,042 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1377 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1377) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse0))))) is different from false [2022-07-20 06:03:59,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1376) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (= 1 (select |c_#valid| .cse0)) (and (forall ((v_ArrVal_1377 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1377) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|))))) is different from false [2022-07-20 06:03:59,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1376) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_1377 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1377) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) (= (select |c_#valid| .cse0) 1)))) is different from false [2022-07-20 06:03:59,168 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1371 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1371))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1376)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (= (select |c_#valid| .cse0) 1) (and (= |c_ULTIMATE.start_main_~head~0#1.base| .cse0) (forall ((v_ArrVal_1377 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1370) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1371) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1377) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))))))) is different from false [2022-07-20 06:03:59,186 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1371))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1376)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (= (select |c_#valid| .cse0) 1) (and (= |c_ULTIMATE.start_main_~head~0#1.base| .cse0) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1370) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1371) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1377)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))))))) is different from false [2022-07-20 06:03:59,218 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1371))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1376)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (= (select |c_#valid| .cse0) 1) (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1370) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1371) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1377) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-07-20 06:03:59,300 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1376 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_15| Int) (v_ArrVal_1371 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1371))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1376)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) 0)) (and (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1370) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1371) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1377) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15| 1) .cse0) 1)))) is different from false [2022-07-20 06:03:59,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1376 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_15| Int) (v_ArrVal_1371 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1371))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1376)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (and (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1370) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1371) |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1377) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) 0)) (= 1 (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15| 1) .cse0))))) is different from false [2022-07-20 06:03:59,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:03:59,457 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-20 06:03:59,458 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 48 treesize of output 1 [2022-07-20 06:03:59,473 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-20 06:03:59,473 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 2 case distinctions, treesize of input 102 treesize of output 68 [2022-07-20 06:03:59,479 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 06:03:59,480 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 271 treesize of output 185 [2022-07-20 06:03:59,487 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 32 treesize of output 24 [2022-07-20 06:03:59,492 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:03:59,492 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 57 treesize of output 51 [2022-07-20 06:04:05,602 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 21 DAG size of output: 13 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 06:04:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 06:04:05,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066448643] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:04:05,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:04:05,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 18] total 44 [2022-07-20 06:04:05,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32120396] [2022-07-20 06:04:05,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:04:05,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 06:04:05,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:04:05,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 06:04:05,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1070, Unknown=9, NotChecked=684, Total=1980 [2022-07-20 06:04:05,629 INFO L87 Difference]: Start difference. First operand 270 states and 309 transitions. Second operand has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:07,793 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc7#1.base|) 1) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|) (= (select .cse1 .cse0) |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (not (<= (+ |c_ULTIMATE.start_main_~head~0#1.offset| 1) |c_ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse2 (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1371))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1376)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (= (select |c_#valid| .cse2) 1) (and (= .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1370) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1371) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1377) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (= (select .cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-07-20 06:04:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:04:09,121 INFO L93 Difference]: Finished difference Result 428 states and 481 transitions. [2022-07-20 06:04:09,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-20 06:04:09,122 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 06:04:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:04:09,123 INFO L225 Difference]: With dead ends: 428 [2022-07-20 06:04:09,123 INFO L226 Difference]: Without dead ends: 428 [2022-07-20 06:04:09,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 10 IntricatePredicates, 1 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=595, Invalid=2627, Unknown=10, NotChecked=1190, Total=4422 [2022-07-20 06:04:09,126 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 379 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2022 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:04:09,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1516 Invalid, 3057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 996 Invalid, 0 Unknown, 2022 Unchecked, 0.5s Time] [2022-07-20 06:04:09,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-07-20 06:04:09,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 285. [2022-07-20 06:04:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 264 states have (on average 1.2424242424242424) internal successors, (328), 284 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 328 transitions. [2022-07-20 06:04:09,132 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 328 transitions. Word has length 38 [2022-07-20 06:04:09,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:04:09,132 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 328 transitions. [2022-07-20 06:04:09,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 328 transitions. [2022-07-20 06:04:09,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:04:09,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:04:09,133 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:04:09,167 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-20 06:04:09,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:09,358 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:04:09,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:04:09,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1599858271, now seen corresponding path program 1 times [2022-07-20 06:04:09,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:04:09,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139931585] [2022-07-20 06:04:09,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:09,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:04:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:09,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:04:09,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139931585] [2022-07-20 06:04:09,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139931585] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:04:09,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030958189] [2022-07-20 06:04:09,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:09,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:09,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:04:09,609 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-20 06:04:09,610 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-20 06:04:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:09,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-20 06:04:09,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:04:09,761 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-20 06:04:09,774 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-20 06:04:09,778 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-20 06:04:09,861 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:04:09,862 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-20 06:04:09,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:09,897 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 21 treesize of output 20 [2022-07-20 06:04:09,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:09,902 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 21 treesize of output 20 [2022-07-20 06:04:09,977 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:09,977 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:04:09,980 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 20 treesize of output 22 [2022-07-20 06:04:10,074 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:04:10,075 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 16 treesize of output 22 [2022-07-20 06:04:10,076 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 7 treesize of output 3 [2022-07-20 06:04:10,087 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:10,088 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 29 [2022-07-20 06:04:10,151 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:10,152 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 29 [2022-07-20 06:04:10,166 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:04:10,167 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 16 treesize of output 22 [2022-07-20 06:04:10,172 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 7 treesize of output 3 [2022-07-20 06:04:10,205 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:10,205 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 38 treesize of output 37 [2022-07-20 06:04:10,208 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 20 treesize of output 22 [2022-07-20 06:04:10,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:10,320 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:10,321 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 27 treesize of output 11 [2022-07-20 06:04:10,324 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 7 [2022-07-20 06:04:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:10,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:04:10,423 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1510 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1510) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1509 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1509) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2022-07-20 06:04:10,451 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1510 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1510) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1509 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1509) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2022-07-20 06:04:10,456 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1509 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1509) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1510 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1510) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:04:10,466 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1510 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1503))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1510)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1509 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1504) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1503) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1509) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2022-07-20 06:04:10,472 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1510 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1503))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1510)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1509 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1504) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1503) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1509)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:04:10,486 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1502 Int)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1502)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1504) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1503) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1509) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1510 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1503))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1510)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:04:10,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:10,653 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:10,653 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 48 treesize of output 54 [2022-07-20 06:04:10,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:10,660 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:10,660 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 35 treesize of output 41 [2022-07-20 06:04:10,663 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:10,663 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 64 treesize of output 50 [2022-07-20 06:04:10,666 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 188 treesize of output 164 [2022-07-20 06:04:10,671 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 57 treesize of output 49 [2022-07-20 06:04:10,673 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 106 treesize of output 90 [2022-07-20 06:04:10,675 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 90 treesize of output 78 [2022-07-20 06:04:10,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:10,685 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-20 06:04:10,685 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 48 treesize of output 1 [2022-07-20 06:04:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:10,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030958189] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:04:10,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:04:10,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 38 [2022-07-20 06:04:10,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009170520] [2022-07-20 06:04:10,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:04:10,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-20 06:04:10,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:04:10,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-20 06:04:10,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=887, Unknown=10, NotChecked=390, Total=1406 [2022-07-20 06:04:10,717 INFO L87 Difference]: Start difference. First operand 285 states and 328 transitions. Second operand has 38 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 38 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:19,002 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_18| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|) 0)) (and (forall ((v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1510 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1503))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) v_ArrVal_1510)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1502 Int)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81| v_ArrVal_1502)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1504) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1503) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) v_ArrVal_1509) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2022-07-20 06:04:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:04:19,935 INFO L93 Difference]: Finished difference Result 360 states and 404 transitions. [2022-07-20 06:04:19,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-20 06:04:19,935 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 38 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 06:04:19,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:04:19,936 INFO L225 Difference]: With dead ends: 360 [2022-07-20 06:04:19,936 INFO L226 Difference]: Without dead ends: 360 [2022-07-20 06:04:19,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 58 SyntacticMatches, 10 SemanticMatches, 71 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=590, Invalid=3711, Unknown=17, NotChecked=938, Total=5256 [2022-07-20 06:04:19,938 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 379 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 2609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1544 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:04:19,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1647 Invalid, 2609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1004 Invalid, 0 Unknown, 1544 Unchecked, 0.4s Time] [2022-07-20 06:04:19,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-07-20 06:04:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 284. [2022-07-20 06:04:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 263 states have (on average 1.231939163498099) internal successors, (324), 283 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 324 transitions. [2022-07-20 06:04:19,942 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 324 transitions. Word has length 38 [2022-07-20 06:04:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:04:19,942 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 324 transitions. [2022-07-20 06:04:19,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 38 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 324 transitions. [2022-07-20 06:04:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 06:04:19,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:04:19,943 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:04:19,961 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-20 06:04:20,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:20,148 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:04:20,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:04:20,149 INFO L85 PathProgramCache]: Analyzing trace with hash 117734209, now seen corresponding path program 1 times [2022-07-20 06:04:20,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:04:20,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818275664] [2022-07-20 06:04:20,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:20,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:04:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:20,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:04:20,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818275664] [2022-07-20 06:04:20,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818275664] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:04:20,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109649580] [2022-07-20 06:04:20,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:20,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:20,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:04:20,257 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-20 06:04:20,257 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-20 06:04:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:20,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 06:04:20,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:04:20,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:20,567 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:04:20,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:20,573 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:20,573 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 15 treesize of output 10 [2022-07-20 06:04:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:20,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:04:20,765 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-20 06:04:20,766 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 24 treesize of output 23 [2022-07-20 06:04:20,773 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-20 06:04:20,773 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 20 treesize of output 12 [2022-07-20 06:04:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:20,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109649580] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:04:20,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:04:20,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2022-07-20 06:04:20,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599783151] [2022-07-20 06:04:20,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:04:20,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 06:04:20,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:04:20,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 06:04:20,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-07-20 06:04:20,927 INFO L87 Difference]: Start difference. First operand 284 states and 324 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:04:21,347 INFO L93 Difference]: Finished difference Result 318 states and 357 transitions. [2022-07-20 06:04:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 06:04:21,347 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-20 06:04:21,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:04:21,348 INFO L225 Difference]: With dead ends: 318 [2022-07-20 06:04:21,348 INFO L226 Difference]: Without dead ends: 318 [2022-07-20 06:04:21,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2022-07-20 06:04:21,349 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 235 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:04:21,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 872 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 500 Invalid, 0 Unknown, 172 Unchecked, 0.2s Time] [2022-07-20 06:04:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-07-20 06:04:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 303. [2022-07-20 06:04:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 282 states have (on average 1.2375886524822695) internal successors, (349), 302 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 349 transitions. [2022-07-20 06:04:21,352 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 349 transitions. Word has length 39 [2022-07-20 06:04:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:04:21,352 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 349 transitions. [2022-07-20 06:04:21,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 349 transitions. [2022-07-20 06:04:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:04:21,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:04:21,353 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-20 06:04:21,369 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-20 06:04:21,553 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,SelfDestructingSolverStorable33 [2022-07-20 06:04:21,553 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:04:21,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:04:21,554 INFO L85 PathProgramCache]: Analyzing trace with hash -645207573, now seen corresponding path program 1 times [2022-07-20 06:04:21,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:04:21,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984248551] [2022-07-20 06:04:21,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:21,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:04:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:04:21,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:04:21,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984248551] [2022-07-20 06:04:21,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984248551] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:04:21,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087093870] [2022-07-20 06:04:21,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:21,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:21,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:04:21,605 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-20 06:04:21,606 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-20 06:04:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:21,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 06:04:21,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:04:21,790 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 13 treesize of output 9 [2022-07-20 06:04:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:04:21,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:04:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:04:21,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087093870] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:04:21,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:04:21,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-20 06:04:21,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851871654] [2022-07-20 06:04:21,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:04:21,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:04:21,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:04:21,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:04:21,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:04:21,848 INFO L87 Difference]: Start difference. First operand 303 states and 349 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:04:21,968 INFO L93 Difference]: Finished difference Result 315 states and 360 transitions. [2022-07-20 06:04:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:04:21,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-20 06:04:21,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:04:21,969 INFO L225 Difference]: With dead ends: 315 [2022-07-20 06:04:21,969 INFO L226 Difference]: Without dead ends: 280 [2022-07-20 06:04:21,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:04:21,970 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 30 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:04:21,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 294 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 189 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2022-07-20 06:04:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-20 06:04:21,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-07-20 06:04:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 259 states have (on average 1.247104247104247) internal successors, (323), 279 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 323 transitions. [2022-07-20 06:04:21,988 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 323 transitions. Word has length 40 [2022-07-20 06:04:21,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:04:21,988 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 323 transitions. [2022-07-20 06:04:21,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:21,989 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 323 transitions. [2022-07-20 06:04:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:04:21,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:04:21,989 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:04:22,007 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-20 06:04:22,190 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,SelfDestructingSolverStorable34 [2022-07-20 06:04:22,190 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:04:22,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:04:22,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1766771785, now seen corresponding path program 1 times [2022-07-20 06:04:22,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:04:22,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299536521] [2022-07-20 06:04:22,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:22,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:04:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:22,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:04:22,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299536521] [2022-07-20 06:04:22,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299536521] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:04:22,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564847264] [2022-07-20 06:04:22,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:22,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:22,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:04:22,520 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-20 06:04:22,521 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-20 06:04:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:22,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-20 06:04:22,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:04:22,665 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-20 06:04:22,680 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-20 06:04:22,685 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-20 06:04:22,720 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:04:22,721 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-20 06:04:22,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:22,746 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 21 treesize of output 20 [2022-07-20 06:04:22,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:22,752 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 21 treesize of output 20 [2022-07-20 06:04:22,847 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:22,847 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 38 treesize of output 37 [2022-07-20 06:04:22,850 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 27 [2022-07-20 06:04:22,955 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:22,955 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 29 [2022-07-20 06:04:22,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:22,961 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 23 treesize of output 23 [2022-07-20 06:04:23,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:23,019 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 23 treesize of output 23 [2022-07-20 06:04:23,028 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:23,028 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 29 [2022-07-20 06:04:23,079 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:23,079 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 38 treesize of output 37 [2022-07-20 06:04:23,083 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 27 [2022-07-20 06:04:23,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:23,232 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 27 treesize of output 11 [2022-07-20 06:04:23,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:23,235 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 26 treesize of output 10 [2022-07-20 06:04:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:23,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:04:23,305 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1754 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1754) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1753 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1753) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:04:23,325 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1754 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1754) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1753 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1753) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2022-07-20 06:04:23,330 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1754 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1754) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1753 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1753) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2022-07-20 06:04:23,339 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1747))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1753)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1748 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1748) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1747) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1754) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:04:23,346 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1747))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1753)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1748 (Array Int Int))) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1748) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1747) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1754)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2022-07-20 06:04:23,359 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1748 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1748) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1747) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1754) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1747))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1753)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2022-07-20 06:04:23,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:23,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:23,502 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 48 treesize of output 54 [2022-07-20 06:04:23,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:23,513 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:23,514 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 35 treesize of output 41 [2022-07-20 06:04:23,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:23,518 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 64 treesize of output 50 [2022-07-20 06:04:23,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:23,523 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:23,523 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 122 treesize of output 100 [2022-07-20 06:04:23,526 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 52 treesize of output 46 [2022-07-20 06:04:23,529 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 11 treesize of output 7 [2022-07-20 06:04:23,534 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 12 treesize of output 8 [2022-07-20 06:04:23,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:23,544 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-20 06:04:23,544 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 48 treesize of output 1 [2022-07-20 06:04:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:23,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564847264] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:04:23,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:04:23,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 34 [2022-07-20 06:04:23,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276864176] [2022-07-20 06:04:23,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:04:23,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 06:04:23,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:04:23,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 06:04:23,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=638, Unknown=10, NotChecked=342, Total=1122 [2022-07-20 06:04:23,572 INFO L87 Difference]: Start difference. First operand 280 states and 323 transitions. Second operand has 34 states, 34 states have (on average 3.088235294117647) internal successors, (105), 34 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:24,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:04:24,117 INFO L93 Difference]: Finished difference Result 304 states and 347 transitions. [2022-07-20 06:04:24,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 06:04:24,117 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.088235294117647) internal successors, (105), 34 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-20 06:04:24,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:04:24,118 INFO L225 Difference]: With dead ends: 304 [2022-07-20 06:04:24,118 INFO L226 Difference]: Without dead ends: 304 [2022-07-20 06:04:24,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=997, Unknown=10, NotChecked=426, Total=1640 [2022-07-20 06:04:24,119 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 97 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 966 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:04:24,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1187 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 617 Invalid, 0 Unknown, 966 Unchecked, 0.3s Time] [2022-07-20 06:04:24,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-20 06:04:24,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 294. [2022-07-20 06:04:24,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 273 states have (on average 1.2417582417582418) internal successors, (339), 293 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 339 transitions. [2022-07-20 06:04:24,122 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 339 transitions. Word has length 40 [2022-07-20 06:04:24,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:04:24,123 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 339 transitions. [2022-07-20 06:04:24,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.088235294117647) internal successors, (105), 34 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:24,123 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 339 transitions. [2022-07-20 06:04:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:04:24,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:04:24,123 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:04:24,147 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-20 06:04:24,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-20 06:04:24,340 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:04:24,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:04:24,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1293820847, now seen corresponding path program 1 times [2022-07-20 06:04:24,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:04:24,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800632519] [2022-07-20 06:04:24,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:24,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:04:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:24,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:04:24,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800632519] [2022-07-20 06:04:24,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800632519] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:04:24,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856943218] [2022-07-20 06:04:24,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:24,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:24,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:04:24,636 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-20 06:04:24,637 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-20 06:04:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:24,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-20 06:04:24,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:04:24,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-20 06:04:24,797 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-20 06:04:24,801 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-20 06:04:24,833 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:04:24,833 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-20 06:04:24,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:24,854 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 21 treesize of output 20 [2022-07-20 06:04:24,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:24,863 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 21 treesize of output 20 [2022-07-20 06:04:24,916 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:24,916 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 38 treesize of output 37 [2022-07-20 06:04:24,919 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 20 treesize of output 22 [2022-07-20 06:04:25,010 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:04:25,010 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 16 treesize of output 22 [2022-07-20 06:04:25,028 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 7 treesize of output 3 [2022-07-20 06:04:25,036 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:25,037 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 29 [2022-07-20 06:04:25,093 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:25,093 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 29 [2022-07-20 06:04:25,105 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:04:25,105 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 16 treesize of output 22 [2022-07-20 06:04:25,134 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 7 treesize of output 3 [2022-07-20 06:04:25,158 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:25,158 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 38 treesize of output 37 [2022-07-20 06:04:25,161 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 20 treesize of output 22 [2022-07-20 06:04:25,311 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 7 [2022-07-20 06:04:25,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:25,340 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:25,340 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 27 treesize of output 11 [2022-07-20 06:04:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:25,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:04:25,438 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1887 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1886 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:04:25,456 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1887 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1887) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1886 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1886) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:04:25,460 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1887 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1887) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1886 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1886) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:04:25,468 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1881) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1880) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1887) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1886)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2022-07-20 06:04:25,474 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1881) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1880) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1887)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1880))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1886)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:04:25,487 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1886)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int)) (v_ArrVal_1879 Int)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1879)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1881) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1880) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1887) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2022-07-20 06:04:25,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_26| Int)) (or (and (forall ((v_ArrVal_1886 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_26|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_26| v_ArrVal_1880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1886)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int)) (v_ArrVal_1879 Int)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1879)) |v_ULTIMATE.start_main_#t~malloc7#1.base_26| v_ArrVal_1881) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_26|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_26| v_ArrVal_1880) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1887) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_26|) 0)))) is different from false [2022-07-20 06:04:25,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:25,599 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:25,600 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 48 treesize of output 41 [2022-07-20 06:04:25,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:25,604 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:25,604 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 262 treesize of output 216 [2022-07-20 06:04:25,608 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 138 treesize of output 122 [2022-07-20 06:04:25,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:25,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 102 [2022-07-20 06:04:25,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:25,631 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-20 06:04:25,632 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 48 treesize of output 1 [2022-07-20 06:04:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 06:04:25,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856943218] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:04:25,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:04:25,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 31 [2022-07-20 06:04:25,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644220021] [2022-07-20 06:04:25,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:04:25,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 06:04:25,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:04:25,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 06:04:25,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=460, Unknown=9, NotChecked=350, Total=930 [2022-07-20 06:04:25,656 INFO L87 Difference]: Start difference. First operand 294 states and 339 transitions. Second operand has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:30,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:04:30,242 INFO L93 Difference]: Finished difference Result 336 states and 380 transitions. [2022-07-20 06:04:30,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 06:04:30,242 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-20 06:04:30,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:04:30,243 INFO L225 Difference]: With dead ends: 336 [2022-07-20 06:04:30,243 INFO L226 Difference]: Without dead ends: 336 [2022-07-20 06:04:30,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=245, Invalid=890, Unknown=15, NotChecked=490, Total=1640 [2022-07-20 06:04:30,244 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 183 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1001 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:04:30,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 785 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 440 Invalid, 0 Unknown, 1001 Unchecked, 0.2s Time] [2022-07-20 06:04:30,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-07-20 06:04:30,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 287. [2022-07-20 06:04:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 266 states have (on average 1.2406015037593985) internal successors, (330), 286 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 330 transitions. [2022-07-20 06:04:30,256 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 330 transitions. Word has length 40 [2022-07-20 06:04:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:04:30,256 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 330 transitions. [2022-07-20 06:04:30,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 330 transitions. [2022-07-20 06:04:30,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:04:30,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:04:30,257 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-07-20 06:04:30,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-20 06:04:30,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-20 06:04:30,471 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:04:30,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:04:30,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1739978080, now seen corresponding path program 1 times [2022-07-20 06:04:30,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:04:30,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239502261] [2022-07-20 06:04:30,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:30,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:04:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:30,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:04:30,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239502261] [2022-07-20 06:04:30,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239502261] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:04:30,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:04:30,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:04:30,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323227011] [2022-07-20 06:04:30,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:04:30,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:04:30,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:04:30,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:04:30,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:04:30,570 INFO L87 Difference]: Start difference. First operand 287 states and 330 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:04:30,876 INFO L93 Difference]: Finished difference Result 311 states and 353 transitions. [2022-07-20 06:04:30,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:04:30,877 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 06:04:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:04:30,877 INFO L225 Difference]: With dead ends: 311 [2022-07-20 06:04:30,877 INFO L226 Difference]: Without dead ends: 306 [2022-07-20 06:04:30,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2022-07-20 06:04:30,878 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 295 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:04:30,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 371 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:04:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-20 06:04:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 278. [2022-07-20 06:04:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 257 states have (on average 1.245136186770428) internal successors, (320), 277 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 320 transitions. [2022-07-20 06:04:30,881 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 320 transitions. Word has length 42 [2022-07-20 06:04:30,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:04:30,881 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 320 transitions. [2022-07-20 06:04:30,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:30,881 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 320 transitions. [2022-07-20 06:04:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:04:30,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:04:30,883 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-20 06:04:30,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-20 06:04:30,884 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:04:30,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:04:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash 25746790, now seen corresponding path program 1 times [2022-07-20 06:04:30,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:04:30,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715471886] [2022-07-20 06:04:30,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:30,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:04:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:31,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:04:31,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715471886] [2022-07-20 06:04:31,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715471886] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:04:31,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691045362] [2022-07-20 06:04:31,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:31,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:31,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:04:31,152 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-20 06:04:31,154 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-20 06:04:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:31,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-20 06:04:31,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:04:31,311 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-20 06:04:31,333 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:04:31,333 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-20 06:04:31,361 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 13 treesize of output 9 [2022-07-20 06:04:31,408 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:31,408 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 34 treesize of output 35 [2022-07-20 06:04:31,481 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-07-20 06:04:31,482 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 28 treesize of output 45 [2022-07-20 06:04:31,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:31,524 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 43 treesize of output 30 [2022-07-20 06:04:31,626 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:31,626 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 49 [2022-07-20 06:04:31,762 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:31,763 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 57 treesize of output 49 [2022-07-20 06:04:31,818 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:31,818 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 57 treesize of output 49 [2022-07-20 06:04:31,838 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:31,838 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 54 treesize of output 49 [2022-07-20 06:04:32,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:32,020 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 45 treesize of output 21 [2022-07-20 06:04:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:32,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:04:32,098 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2065 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2065) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2022-07-20 06:04:32,156 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2065 (Array Int Int)) (v_ArrVal_2062 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2062))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2065)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2022-07-20 06:04:32,205 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2065 (Array Int Int)) (v_ArrVal_2062 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2062))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2065)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2022-07-20 06:04:32,214 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2059 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_29| Int) (v_ArrVal_2065 (Array Int Int)) (v_ArrVal_2062 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_2059) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_2062))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2065)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|) 0)))) is different from false [2022-07-20 06:04:32,231 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_109| Int) (v_ArrVal_2059 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_29| Int) (v_ArrVal_2065 (Array Int Int)) (v_ArrVal_2062 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_109| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_2059) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_109| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_2062))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_109|) v_ArrVal_2065)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2022-07-20 06:04:32,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_109| Int) (v_ArrVal_2058 (Array Int Int)) (v_ArrVal_2059 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_29| Int) (v_ArrVal_2065 (Array Int Int)) (v_ArrVal_2062 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_2059) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2058))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_109| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_2062))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_109|) v_ArrVal_2065)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_109| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|) 0)))) is different from false [2022-07-20 06:04:32,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:32,313 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 95 treesize of output 66 [2022-07-20 06:04:32,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:32,321 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 96 treesize of output 92 [2022-07-20 06:04:32,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:32,326 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 48 treesize of output 40 [2022-07-20 06:04:32,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:32,332 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 38 treesize of output 34 [2022-07-20 06:04:32,335 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 70 treesize of output 62 [2022-07-20 06:04:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 06:04:32,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691045362] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:04:32,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:04:32,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 39 [2022-07-20 06:04:32,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017595448] [2022-07-20 06:04:32,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:04:32,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-20 06:04:32,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:04:32,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-20 06:04:32,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=912, Unknown=36, NotChecked=414, Total=1560 [2022-07-20 06:04:32,543 INFO L87 Difference]: Start difference. First operand 278 states and 320 transitions. Second operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 40 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:04:33,369 INFO L93 Difference]: Finished difference Result 410 states and 472 transitions. [2022-07-20 06:04:33,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-20 06:04:33,369 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 40 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 06:04:33,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:04:33,370 INFO L225 Difference]: With dead ends: 410 [2022-07-20 06:04:33,370 INFO L226 Difference]: Without dead ends: 410 [2022-07-20 06:04:33,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 64 SyntacticMatches, 11 SemanticMatches, 52 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=373, Invalid=1865, Unknown=42, NotChecked=582, Total=2862 [2022-07-20 06:04:33,371 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 260 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 2284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1622 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:04:33,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1342 Invalid, 2284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 624 Invalid, 0 Unknown, 1622 Unchecked, 0.3s Time] [2022-07-20 06:04:33,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-20 06:04:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 306. [2022-07-20 06:04:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 285 states have (on average 1.2421052631578948) internal successors, (354), 305 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 354 transitions. [2022-07-20 06:04:33,375 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 354 transitions. Word has length 42 [2022-07-20 06:04:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:04:33,375 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 354 transitions. [2022-07-20 06:04:33,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 40 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 354 transitions. [2022-07-20 06:04:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:04:33,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:04:33,378 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-20 06:04:33,398 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-20 06:04:33,587 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,SelfDestructingSolverStorable38 [2022-07-20 06:04:33,587 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:04:33,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:04:33,588 INFO L85 PathProgramCache]: Analyzing trace with hash 25746791, now seen corresponding path program 1 times [2022-07-20 06:04:33,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:04:33,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085751193] [2022-07-20 06:04:33,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:33,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:04:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:33,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:04:33,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085751193] [2022-07-20 06:04:33,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085751193] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:04:33,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884085627] [2022-07-20 06:04:33,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:33,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:33,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:04:34,010 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-20 06:04:34,020 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-20 06:04:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:34,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-20 06:04:34,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:04:34,199 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-20 06:04:34,214 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-20 06:04:34,227 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:04:34,227 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-20 06:04:34,257 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-20 06:04:34,262 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 13 treesize of output 9 [2022-07-20 06:04:34,357 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:34,358 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 57 treesize of output 54 [2022-07-20 06:04:34,361 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 22 treesize of output 24 [2022-07-20 06:04:34,454 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-20 06:04:34,454 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 1 case distinctions, treesize of input 18 treesize of output 30 [2022-07-20 06:04:34,476 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-20 06:04:34,476 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 22 treesize of output 24 [2022-07-20 06:04:34,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:34,559 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 21 treesize of output 20 [2022-07-20 06:04:34,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:34,564 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 43 treesize of output 30 [2022-07-20 06:04:34,697 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:34,697 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 57 [2022-07-20 06:04:34,703 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 20 treesize of output 22 [2022-07-20 06:04:34,871 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:34,872 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 57 treesize of output 49 [2022-07-20 06:04:34,894 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:04:34,894 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 16 treesize of output 22 [2022-07-20 06:04:34,902 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 7 treesize of output 3 [2022-07-20 06:04:34,995 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:04:34,996 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 16 treesize of output 22 [2022-07-20 06:04:35,002 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 7 treesize of output 3 [2022-07-20 06:04:35,012 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:35,013 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 57 treesize of output 49 [2022-07-20 06:04:35,069 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:35,069 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 64 treesize of output 57 [2022-07-20 06:04:35,072 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 20 treesize of output 22 [2022-07-20 06:04:35,265 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-20 06:04:35,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:35,269 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:35,270 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 45 treesize of output 21 [2022-07-20 06:04:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:35,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:04:35,391 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2218 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2218) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2218) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) is different from false [2022-07-20 06:04:35,410 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2218 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2218) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2218) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) is different from false [2022-07-20 06:04:35,416 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2218 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2218) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2218) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2219) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2022-07-20 06:04:35,426 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2213) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2212) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2218) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2212))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2213) .cse0 v_ArrVal_2218) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2219) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))))) is different from false [2022-07-20 06:04:35,436 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2212))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2213) .cse1 v_ArrVal_2218) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2219) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) (forall ((v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int))) (<= 0 (select (select (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_2213) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2212) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2218)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:04:35,454 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2211 Int) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2211)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2213) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2212) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2218) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2211 Int) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2212))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2211)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2213) .cse0 v_ArrVal_2218) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2219) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))))) is different from false [2022-07-20 06:04:35,871 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2206 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_32| Int) (v_ArrVal_2205 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_114| Int)) (or (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2211 Int) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2207 Int)) (let ((.cse3 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2205))) (store .cse4 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_114| |v_ULTIMATE.start_main_#t~malloc7#1.base_32|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_32| v_ArrVal_2212))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_114|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ 4 (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2206))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_114| v_ArrVal_2211))) |v_ULTIMATE.start_main_#t~malloc7#1.base_32| v_ArrVal_2213) .cse1 v_ArrVal_2218) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_32| v_ArrVal_2207) (select (select (store .cse3 .cse1 v_ArrVal_2219) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2211 Int) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int))) (<= 0 (select (select (store (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2206))) (store .cse5 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_114| v_ArrVal_2211))) |v_ULTIMATE.start_main_#t~malloc7#1.base_32| v_ArrVal_2213) (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2205))) (store .cse6 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_114| |v_ULTIMATE.start_main_#t~malloc7#1.base_32|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_32| v_ArrVal_2212) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_114|) v_ArrVal_2218) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_32|) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_114| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:04:36,274 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:36,275 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 90 treesize of output 81 [2022-07-20 06:04:36,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:36,295 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 240 treesize of output 236 [2022-07-20 06:04:36,299 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:36,299 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 228 treesize of output 158 [2022-07-20 06:04:36,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:36,319 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 126 treesize of output 120 [2022-07-20 06:04:36,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:36,326 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 54 treesize of output 50 [2022-07-20 06:04:36,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:36,353 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 64 treesize of output 56 [2022-07-20 06:04:36,358 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 94 [2022-07-20 06:04:36,385 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:36,386 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 1 case distinctions, treesize of input 184 treesize of output 175 [2022-07-20 06:04:36,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:36,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:36,392 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 309 treesize of output 305 [2022-07-20 06:04:36,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:36,401 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 1 case distinctions, treesize of input 297 treesize of output 187 [2022-07-20 06:04:36,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:36,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:36,406 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 69 treesize of output 63 [2022-07-20 06:04:36,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:36,411 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 57 treesize of output 45 [2022-07-20 06:04:36,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:36,415 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 28 treesize of output 20 [2022-07-20 06:04:36,419 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 18 treesize of output 14 [2022-07-20 06:04:36,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:36,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884085627] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:04:36,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:04:36,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 43 [2022-07-20 06:04:36,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068107437] [2022-07-20 06:04:36,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:04:36,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-20 06:04:36,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:04:36,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-20 06:04:36,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1172, Unknown=12, NotChecked=532, Total=1892 [2022-07-20 06:04:36,895 INFO L87 Difference]: Start difference. First operand 306 states and 354 transitions. Second operand has 44 states, 43 states have (on average 2.7906976744186047) internal successors, (120), 44 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:04:44,580 INFO L93 Difference]: Finished difference Result 433 states and 495 transitions. [2022-07-20 06:04:44,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 06:04:44,580 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.7906976744186047) internal successors, (120), 44 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 06:04:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:04:44,581 INFO L225 Difference]: With dead ends: 433 [2022-07-20 06:04:44,581 INFO L226 Difference]: Without dead ends: 433 [2022-07-20 06:04:44,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=491, Invalid=2601, Unknown=16, NotChecked=798, Total=3906 [2022-07-20 06:04:44,582 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 361 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 3368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2398 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:04:44,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1653 Invalid, 3368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 915 Invalid, 0 Unknown, 2398 Unchecked, 0.5s Time] [2022-07-20 06:04:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-07-20 06:04:44,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 319. [2022-07-20 06:04:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 298 states have (on average 1.2416107382550337) internal successors, (370), 318 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 370 transitions. [2022-07-20 06:04:44,586 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 370 transitions. Word has length 42 [2022-07-20 06:04:44,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:04:44,586 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 370 transitions. [2022-07-20 06:04:44,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.7906976744186047) internal successors, (120), 44 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 370 transitions. [2022-07-20 06:04:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:04:44,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:04:44,588 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-20 06:04:44,607 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-20 06:04:44,799 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,SelfDestructingSolverStorable39 [2022-07-20 06:04:44,799 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:04:44,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:04:44,800 INFO L85 PathProgramCache]: Analyzing trace with hash -337548449, now seen corresponding path program 1 times [2022-07-20 06:04:44,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:04:44,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879619461] [2022-07-20 06:04:44,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:44,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:04:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:45,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:04:45,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879619461] [2022-07-20 06:04:45,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879619461] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:04:45,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862772138] [2022-07-20 06:04:45,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:45,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:45,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:04:45,194 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-20 06:04:45,195 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-20 06:04:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:45,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-20 06:04:45,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:04:45,356 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-20 06:04:45,379 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:04:45,379 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-20 06:04:45,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-20 06:04:45,416 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 13 treesize of output 9 [2022-07-20 06:04:45,425 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-20 06:04:45,505 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:45,505 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 57 treesize of output 54 [2022-07-20 06:04:45,507 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 22 treesize of output 24 [2022-07-20 06:04:45,596 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-20 06:04:45,596 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 22 treesize of output 24 [2022-07-20 06:04:45,605 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 18 treesize of output 20 [2022-07-20 06:04:45,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:45,656 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 21 treesize of output 20 [2022-07-20 06:04:45,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:45,660 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 43 treesize of output 30 [2022-07-20 06:04:45,778 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:45,778 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 57 [2022-07-20 06:04:45,782 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-20 06:04:45,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:45,989 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 23 treesize of output 23 [2022-07-20 06:04:45,998 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:45,998 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 57 treesize of output 49 [2022-07-20 06:04:46,068 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:46,068 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 57 treesize of output 49 [2022-07-20 06:04:46,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:46,073 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 23 treesize of output 23 [2022-07-20 06:04:46,095 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:46,095 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 64 treesize of output 57 [2022-07-20 06:04:46,098 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 27 treesize of output 27 [2022-07-20 06:04:46,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:46,338 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 22 treesize of output 10 [2022-07-20 06:04:46,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:04:46,342 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:46,342 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 45 treesize of output 21 [2022-07-20 06:04:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:46,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:04:46,505 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2372 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2373) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2372) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) (forall ((v_ArrVal_2373 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2373) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:04:46,530 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2372 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2373) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2372) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) (forall ((v_ArrVal_2373 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2373) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:04:46,537 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2373 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2373) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2372 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2373) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2372) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2022-07-20 06:04:46,550 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2372 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2367))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2366) .cse0 v_ArrVal_2373) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2372) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2373 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2366) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2367) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2373) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-20 06:04:46,560 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2373 (Array Int Int))) (<= 0 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2366) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2367) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2373)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2372 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2367))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2366) .cse2 v_ArrVal_2373) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2372) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))))))) is different from false [2022-07-20 06:04:46,578 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2373 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2366) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2367) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2373) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2372 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2367))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2366) .cse0 v_ArrVal_2373) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2372) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))))) is different from false [2022-07-20 06:04:47,035 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2359 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_119| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_35| Int) (v_ArrVal_2360 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_35|) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_119| |c_ULTIMATE.start_main_~head~0#1.offset|)) (and (forall ((v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2373 (Array Int Int))) (<= 0 (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2360))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_119| 0))) |v_ULTIMATE.start_main_#t~malloc7#1.base_35| v_ArrVal_2366) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2359))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_119| |v_ULTIMATE.start_main_#t~malloc7#1.base_35|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_35| v_ArrVal_2367) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_119|) v_ArrVal_2373) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_2361 Int) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2373 (Array Int Int)) (v_ArrVal_2372 (Array Int Int))) (let ((.cse5 (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2359))) (store .cse6 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_119| |v_ULTIMATE.start_main_#t~malloc7#1.base_35|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_35| v_ArrVal_2367))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_119|)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ (select (select (store (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2360))) (store .cse2 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_119| 0))) |v_ULTIMATE.start_main_#t~malloc7#1.base_35| v_ArrVal_2366) .cse3 v_ArrVal_2373) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_35| v_ArrVal_2361) (select (select (store .cse5 .cse3 v_ArrVal_2372) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))))))))) is different from false [2022-07-20 06:04:48,371 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:48,371 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 90 treesize of output 81 [2022-07-20 06:04:48,376 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:48,377 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 70 treesize of output 61 [2022-07-20 06:04:48,379 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:48,382 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 160 treesize of output 156 [2022-07-20 06:04:48,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:48,386 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 126 treesize of output 120 [2022-07-20 06:04:48,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:48,392 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 64 treesize of output 56 [2022-07-20 06:04:48,395 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:48,397 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 54 treesize of output 50 [2022-07-20 06:04:48,399 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 94 [2022-07-20 06:04:48,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:48,417 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 1 case distinctions, treesize of input 184 treesize of output 175 [2022-07-20 06:04:48,424 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:04:48,424 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 1 case distinctions, treesize of input 164 treesize of output 115 [2022-07-20 06:04:48,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:48,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:48,430 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 189 treesize of output 185 [2022-07-20 06:04:48,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:48,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:48,435 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 128 treesize of output 122 [2022-07-20 06:04:48,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:48,438 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 116 treesize of output 104 [2022-07-20 06:04:48,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:48,457 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 56 treesize of output 44 [2022-07-20 06:04:48,475 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 46 treesize of output 38 [2022-07-20 06:04:48,478 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 78 treesize of output 70 [2022-07-20 06:04:48,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:04:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:48,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862772138] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:04:48,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:04:48,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 44 [2022-07-20 06:04:48,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951691396] [2022-07-20 06:04:48,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:04:48,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 06:04:48,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:04:48,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 06:04:48,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1231, Unknown=13, NotChecked=546, Total=1980 [2022-07-20 06:04:48,629 INFO L87 Difference]: Start difference. First operand 319 states and 370 transitions. Second operand has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:04:50,602 INFO L93 Difference]: Finished difference Result 433 states and 495 transitions. [2022-07-20 06:04:50,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 06:04:50,603 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 06:04:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:04:50,604 INFO L225 Difference]: With dead ends: 433 [2022-07-20 06:04:50,604 INFO L226 Difference]: Without dead ends: 433 [2022-07-20 06:04:50,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=521, Invalid=2798, Unknown=15, NotChecked=826, Total=4160 [2022-07-20 06:04:50,605 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 550 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2362 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:04:50,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1688 Invalid, 3354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 947 Invalid, 0 Unknown, 2362 Unchecked, 0.6s Time] [2022-07-20 06:04:50,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-07-20 06:04:50,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 306. [2022-07-20 06:04:50,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 285 states have (on average 1.2385964912280703) internal successors, (353), 305 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 353 transitions. [2022-07-20 06:04:50,620 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 353 transitions. Word has length 42 [2022-07-20 06:04:50,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:04:50,621 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 353 transitions. [2022-07-20 06:04:50,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 353 transitions. [2022-07-20 06:04:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:04:50,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:04:50,621 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-20 06:04:50,653 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-20 06:04:50,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:50,836 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:04:50,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:04:50,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1117398886, now seen corresponding path program 1 times [2022-07-20 06:04:50,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:04:50,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677915781] [2022-07-20 06:04:50,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:50,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:04:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:04:51,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:04:51,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677915781] [2022-07-20 06:04:51,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677915781] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:04:51,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862635567] [2022-07-20 06:04:51,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:51,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:51,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:04:51,199 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-20 06:04:51,234 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-20 06:04:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:51,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-20 06:04:51,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:04:51,413 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-20 06:04:51,437 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-20 06:04:51,441 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-20 06:04:51,529 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:04:51,529 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-20 06:04:51,586 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-20 06:04:51,586 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 21 treesize of output 20 [2022-07-20 06:04:51,615 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-20 06:04:51,615 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 1 case distinctions, treesize of input 21 treesize of output 26 [2022-07-20 06:04:51,795 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:51,796 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 43 [2022-07-20 06:04:51,813 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-20 06:04:52,047 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:52,048 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 60 treesize of output 54 [2022-07-20 06:04:52,056 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:52,057 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 69 treesize of output 69 [2022-07-20 06:04:52,135 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:52,135 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 60 treesize of output 54 [2022-07-20 06:04:52,144 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:52,144 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 69 treesize of output 69 [2022-07-20 06:04:52,182 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:04:52,183 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-20 06:04:52,249 INFO L356 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2022-07-20 06:04:52,250 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 3 case distinctions, treesize of input 67 treesize of output 53 [2022-07-20 06:04:52,259 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:04:52,260 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 1 case distinctions, treesize of input 68 treesize of output 68 [2022-07-20 06:04:52,264 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-20 06:04:52,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-20 06:04:52,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:04:52,465 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-20 06:04:52,468 INFO L158 Benchmark]: Toolchain (without parser) took 112033.80ms. Allocated memory was 81.8MB in the beginning and 157.3MB in the end (delta: 75.5MB). Free memory was 42.7MB in the beginning and 49.0MB in the end (delta: -6.4MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. [2022-07-20 06:04:52,468 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 81.8MB. Free memory is still 60.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:04:52,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 661.67ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 42.5MB in the beginning and 73.0MB in the end (delta: -30.5MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2022-07-20 06:04:52,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.14ms. Allocated memory is still 107.0MB. Free memory was 73.0MB in the beginning and 70.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:04:52,468 INFO L158 Benchmark]: Boogie Preprocessor took 64.36ms. Allocated memory is still 107.0MB. Free memory was 70.9MB in the beginning and 68.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:04:52,468 INFO L158 Benchmark]: RCFGBuilder took 897.30ms. Allocated memory is still 107.0MB. Free memory was 68.8MB in the beginning and 44.9MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-07-20 06:04:52,469 INFO L158 Benchmark]: TraceAbstraction took 110294.12ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 44.5MB in the beginning and 49.0MB in the end (delta: -4.5MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2022-07-20 06:04:52,469 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 81.8MB. Free memory is still 60.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 661.67ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 42.5MB in the beginning and 73.0MB in the end (delta: -30.5MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.14ms. Allocated memory is still 107.0MB. Free memory was 73.0MB in the beginning and 70.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.36ms. Allocated memory is still 107.0MB. Free memory was 70.9MB in the beginning and 68.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 897.30ms. Allocated memory is still 107.0MB. Free memory was 68.8MB in the beginning and 44.9MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 110294.12ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 44.5MB in the beginning and 49.0MB in the end (delta: -4.5MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-20 06:04:52,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/forester-heap/dll-optional-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:04:55,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:04:55,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:04:55,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:04:55,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:04:55,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:04:55,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:04:55,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:04:55,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:04:55,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:04:55,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:04:55,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:04:55,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:04:55,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:04:55,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:04:55,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:04:55,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:04:55,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:04:55,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:04:55,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:04:55,521 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:04:55,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:04:55,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:04:55,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:04:55,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:04:55,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:04:55,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:04:55,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:04:55,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:04:55,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:04:55,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:04:55,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:04:55,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:04:55,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:04:55,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:04:55,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:04:55,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:04:55,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:04:55,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:04:55,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:04:55,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:04:55,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:04:55,560 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 06:04:55,601 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:04:55,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:04:55,602 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:04:55,602 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:04:55,603 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:04:55,603 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:04:55,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:04:55,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:04:55,604 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:04:55,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:04:55,605 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:04:55,605 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:04:55,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:04:55,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:04:55,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:04:55,606 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:04:55,606 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:04:55,606 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:04:55,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:04:55,606 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:04:55,606 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 06:04:55,607 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 06:04:55,607 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:04:55,607 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:04:55,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:04:55,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:04:55,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:04:55,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:04:55,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:04:55,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:04:55,620 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 06:04:55,620 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 06:04:55,620 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 06:04:55,620 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2022-07-20 06:04:56,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:04:56,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:04:56,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:04:56,136 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:04:56,142 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:04:56,145 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-optional-1.i [2022-07-20 06:04:56,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4af823f08/74f593e9b77a4e7ab46b20989471ccd1/FLAG9bf0a23b3 [2022-07-20 06:04:56,942 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:04:56,943 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2022-07-20 06:04:56,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4af823f08/74f593e9b77a4e7ab46b20989471ccd1/FLAG9bf0a23b3 [2022-07-20 06:04:56,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4af823f08/74f593e9b77a4e7ab46b20989471ccd1 [2022-07-20 06:04:56,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:04:56,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:04:56,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:04:56,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:04:56,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:04:57,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:04:56" (1/1) ... [2022-07-20 06:04:57,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a22ad2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:04:57, skipping insertion in model container [2022-07-20 06:04:57,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:04:56" (1/1) ... [2022-07-20 06:04:57,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:04:57,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:04:57,526 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/forester-heap/dll-optional-1.i[22753,22766] [2022-07-20 06:04:57,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:04:57,565 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:04:57,629 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/forester-heap/dll-optional-1.i[22753,22766] [2022-07-20 06:04:57,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:04:57,680 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:04:57,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:04:57 WrapperNode [2022-07-20 06:04:57,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:04:57,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:04:57,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:04:57,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:04:57,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:04:57" (1/1) ... [2022-07-20 06:04:57,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:04:57" (1/1) ... [2022-07-20 06:04:57,792 INFO L137 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 136 [2022-07-20 06:04:57,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:04:57,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:04:57,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:04:57,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:04:57,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:04:57" (1/1) ... [2022-07-20 06:04:57,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:04:57" (1/1) ... [2022-07-20 06:04:57,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:04:57" (1/1) ... [2022-07-20 06:04:57,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:04:57" (1/1) ... [2022-07-20 06:04:57,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:04:57" (1/1) ... [2022-07-20 06:04:57,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:04:57" (1/1) ... [2022-07-20 06:04:57,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:04:57" (1/1) ... [2022-07-20 06:04:57,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:04:57,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:04:57,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:04:57,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:04:57,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:04:57" (1/1) ... [2022-07-20 06:04:57,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:04:57,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:04:57,941 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-20 06:04:57,987 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-20 06:04:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 06:04:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:04:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:04:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:04:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:04:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:04:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 06:04:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 06:04:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:04:58,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:04:58,185 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:04:58,194 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:04:59,012 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:04:59,017 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:04:59,017 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-20 06:04:59,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:04:59 BoogieIcfgContainer [2022-07-20 06:04:59,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:04:59,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:04:59,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:04:59,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:04:59,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:04:56" (1/3) ... [2022-07-20 06:04:59,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e56501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:04:59, skipping insertion in model container [2022-07-20 06:04:59,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:04:57" (2/3) ... [2022-07-20 06:04:59,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e56501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:04:59, skipping insertion in model container [2022-07-20 06:04:59,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:04:59" (3/3) ... [2022-07-20 06:04:59,033 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2022-07-20 06:04:59,055 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:04:59,071 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-07-20 06:04:59,136 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:04:59,146 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@32e53b42, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@66caf702 [2022-07-20 06:04:59,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-07-20 06:04:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 77 states have (on average 2.155844155844156) internal successors, (166), 149 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:04:59,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:04:59,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:04:59,170 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:04:59,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:04:59,175 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 06:04:59,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:04:59,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057185857] [2022-07-20 06:04:59,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:04:59,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:04:59,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:04:59,225 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:04:59,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 06:04:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:04:59,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:04:59,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:04:59,414 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-20 06:04:59,445 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-20 06:04:59,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:04:59,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:04:59,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057185857] [2022-07-20 06:04:59,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057185857] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:04:59,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:04:59,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:04:59,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84901002] [2022-07-20 06:04:59,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:04:59,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:04:59,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:04:59,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:04:59,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:04:59,510 INFO L87 Difference]: Start difference. First operand has 150 states, 77 states have (on average 2.155844155844156) internal successors, (166), 149 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:04:59,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:04:59,961 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2022-07-20 06:04:59,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:04:59,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 06:04:59,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:04:59,975 INFO L225 Difference]: With dead ends: 151 [2022-07-20 06:04:59,976 INFO L226 Difference]: Without dead ends: 147 [2022-07-20 06:04:59,977 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-20 06:04:59,981 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 134 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:04:59,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 84 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:05:00,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-20 06:05:00,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 141. [2022-07-20 06:05:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 79 states have (on average 1.9367088607594938) internal successors, (153), 140 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2022-07-20 06:05:00,073 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 3 [2022-07-20 06:05:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:00,087 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2022-07-20 06:05:00,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2022-07-20 06:05:00,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:05:00,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:00,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:05:00,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:00,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:00,296 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:00,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:00,296 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 06:05:00,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:00,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90115430] [2022-07-20 06:05:00,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:00,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:00,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:00,316 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:00,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 06:05:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:00,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:05:00,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:00,433 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-20 06:05:00,441 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-20 06:05:00,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:00,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:00,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90115430] [2022-07-20 06:05:00,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90115430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:00,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:00,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:05:00,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056565514] [2022-07-20 06:05:00,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:00,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:05:00,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:00,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:05:00,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:05:00,449 INFO L87 Difference]: Start difference. First operand 141 states and 153 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:00,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:00,912 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2022-07-20 06:05:00,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:05:00,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 06:05:00,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:00,913 INFO L225 Difference]: With dead ends: 136 [2022-07-20 06:05:00,914 INFO L226 Difference]: Without dead ends: 136 [2022-07-20 06:05:00,914 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-20 06:05:00,915 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 110 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:00,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 97 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:05:00,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-20 06:05:00,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2022-07-20 06:05:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 79 states have (on average 1.8227848101265822) internal successors, (144), 131 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2022-07-20 06:05:00,928 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 3 [2022-07-20 06:05:00,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:00,928 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2022-07-20 06:05:00,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-07-20 06:05:00,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 06:05:00,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:00,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:05:00,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:01,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:01,136 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:01,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:01,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2006091119, now seen corresponding path program 1 times [2022-07-20 06:05:01,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:01,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118834116] [2022-07-20 06:05:01,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:01,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:01,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:01,149 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:01,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 06:05:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:01,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:05:01,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:01,275 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-20 06:05:01,302 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-20 06:05:01,341 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 21 treesize of output 9 [2022-07-20 06:05:01,348 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-20 06:05:01,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:01,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:01,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118834116] [2022-07-20 06:05:01,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118834116] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:01,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:01,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:05:01,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907167647] [2022-07-20 06:05:01,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:01,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:05:01,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:01,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:05:01,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:05:01,372 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:02,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:02,048 INFO L93 Difference]: Finished difference Result 175 states and 192 transitions. [2022-07-20 06:05:02,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:05:02,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 06:05:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:02,058 INFO L225 Difference]: With dead ends: 175 [2022-07-20 06:05:02,058 INFO L226 Difference]: Without dead ends: 175 [2022-07-20 06:05:02,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:05:02,059 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 50 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:02,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 318 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 06:05:02,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-20 06:05:02,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 131. [2022-07-20 06:05:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 79 states have (on average 1.8101265822784811) internal successors, (143), 130 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2022-07-20 06:05:02,073 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 11 [2022-07-20 06:05:02,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:02,073 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2022-07-20 06:05:02,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2022-07-20 06:05:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 06:05:02,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:02,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:05:02,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:02,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:02,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:02,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:02,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2006091120, now seen corresponding path program 1 times [2022-07-20 06:05:02,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:02,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438934556] [2022-07-20 06:05:02,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:02,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:02,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:02,288 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:02,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 06:05:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:02,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 06:05:02,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:02,428 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-20 06:05:02,443 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-20 06:05:02,448 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-20 06:05:02,512 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 21 treesize of output 9 [2022-07-20 06:05:02,519 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 7 [2022-07-20 06:05:02,534 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-20 06:05:02,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:02,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:02,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438934556] [2022-07-20 06:05:02,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438934556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:02,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:02,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:05:02,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273221646] [2022-07-20 06:05:02,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:02,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:05:02,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:02,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:05:02,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:05:02,552 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:03,240 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-07-20 06:05:03,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:05:03,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 06:05:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:03,242 INFO L225 Difference]: With dead ends: 130 [2022-07-20 06:05:03,242 INFO L226 Difference]: Without dead ends: 130 [2022-07-20 06:05:03,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:05:03,243 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 2 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:03,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 354 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 06:05:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-20 06:05:03,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-20 06:05:03,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.7974683544303798) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2022-07-20 06:05:03,252 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 11 [2022-07-20 06:05:03,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:03,252 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2022-07-20 06:05:03,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:03,253 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-07-20 06:05:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 06:05:03,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:03,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:05:03,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:03,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:03,463 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:03,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:03,463 INFO L85 PathProgramCache]: Analyzing trace with hash 710692029, now seen corresponding path program 1 times [2022-07-20 06:05:03,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:03,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307287040] [2022-07-20 06:05:03,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:03,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:03,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:03,469 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:03,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 06:05:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:03,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:05:03,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:03,590 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-20 06:05:03,644 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 06:05:03,644 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 17 [2022-07-20 06:05:03,659 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-20 06:05:03,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:03,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:03,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307287040] [2022-07-20 06:05:03,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307287040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:03,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:03,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:05:03,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170567199] [2022-07-20 06:05:03,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:03,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:05:03,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:03,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:05:03,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:05:03,661 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:04,007 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2022-07-20 06:05:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:05:04,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 06:05:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:04,009 INFO L225 Difference]: With dead ends: 131 [2022-07-20 06:05:04,009 INFO L226 Difference]: Without dead ends: 131 [2022-07-20 06:05:04,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:05:04,009 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 180 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:04,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 71 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:05:04,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-20 06:05:04,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2022-07-20 06:05:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 121 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2022-07-20 06:05:04,036 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 11 [2022-07-20 06:05:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:04,037 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2022-07-20 06:05:04,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2022-07-20 06:05:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 06:05:04,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:04,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:05:04,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:04,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:04,245 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:04,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:04,245 INFO L85 PathProgramCache]: Analyzing trace with hash 710692030, now seen corresponding path program 1 times [2022-07-20 06:05:04,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:04,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818273698] [2022-07-20 06:05:04,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:04,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:04,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:04,251 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:04,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 06:05:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:04,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:05:04,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:04,379 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-20 06:05:04,471 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:04,472 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-20 06:05:04,484 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-20 06:05:04,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:04,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:04,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818273698] [2022-07-20 06:05:04,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818273698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:04,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:04,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:05:04,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942837863] [2022-07-20 06:05:04,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:04,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:05:04,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:04,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:05:04,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:05:04,499 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:05,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:05,043 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2022-07-20 06:05:05,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:05:05,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 06:05:05,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:05,044 INFO L225 Difference]: With dead ends: 178 [2022-07-20 06:05:05,044 INFO L226 Difference]: Without dead ends: 178 [2022-07-20 06:05:05,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:05:05,045 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 184 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:05,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 112 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 06:05:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-20 06:05:05,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 152. [2022-07-20 06:05:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 115 states have (on average 1.5565217391304347) internal successors, (179), 151 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 179 transitions. [2022-07-20 06:05:05,050 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 179 transitions. Word has length 11 [2022-07-20 06:05:05,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:05,050 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 179 transitions. [2022-07-20 06:05:05,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2022-07-20 06:05:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 06:05:05,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:05,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:05:05,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:05,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:05,263 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:05,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:05,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1962503516, now seen corresponding path program 1 times [2022-07-20 06:05:05,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:05,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387716996] [2022-07-20 06:05:05,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:05,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:05,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:05,269 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:05,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 06:05:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:05,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:05:05,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:05,377 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-20 06:05:05,405 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-20 06:05:05,422 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-20 06:05:05,429 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-20 06:05:05,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:05,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:05,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387716996] [2022-07-20 06:05:05,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387716996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:05,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:05,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:05:05,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706627061] [2022-07-20 06:05:05,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:05,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:05:05,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:05,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:05:05,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:05:05,442 INFO L87 Difference]: Start difference. First operand 152 states and 179 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:06,005 INFO L93 Difference]: Finished difference Result 151 states and 177 transitions. [2022-07-20 06:05:06,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:05:06,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-20 06:05:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:06,006 INFO L225 Difference]: With dead ends: 151 [2022-07-20 06:05:06,006 INFO L226 Difference]: Without dead ends: 151 [2022-07-20 06:05:06,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:05:06,007 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 9 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:06,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 296 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 06:05:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-20 06:05:06,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-07-20 06:05:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 115 states have (on average 1.5391304347826087) internal successors, (177), 150 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2022-07-20 06:05:06,020 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 14 [2022-07-20 06:05:06,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:06,020 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2022-07-20 06:05:06,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2022-07-20 06:05:06,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 06:05:06,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:06,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:05:06,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:06,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:06,228 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:06,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:06,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1962503515, now seen corresponding path program 1 times [2022-07-20 06:05:06,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:06,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912699267] [2022-07-20 06:05:06,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:06,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:06,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:06,231 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:06,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 06:05:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:06,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 06:05:06,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:06,355 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-20 06:05:06,381 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-20 06:05:06,387 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-20 06:05:06,425 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-20 06:05:06,430 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-20 06:05:06,441 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-20 06:05:06,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:06,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:06,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912699267] [2022-07-20 06:05:06,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912699267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:06,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:06,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:05:06,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639160736] [2022-07-20 06:05:06,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:06,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:05:06,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:06,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:05:06,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:05:06,443 INFO L87 Difference]: Start difference. First operand 151 states and 177 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:06,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:06,891 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2022-07-20 06:05:06,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:05:06,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-20 06:05:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:06,892 INFO L225 Difference]: With dead ends: 150 [2022-07-20 06:05:06,892 INFO L226 Difference]: Without dead ends: 150 [2022-07-20 06:05:06,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:05:06,893 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:06,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 287 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:05:06,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-20 06:05:06,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-07-20 06:05:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 115 states have (on average 1.5217391304347827) internal successors, (175), 149 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2022-07-20 06:05:06,897 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 14 [2022-07-20 06:05:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:06,897 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2022-07-20 06:05:06,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2022-07-20 06:05:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:05:06,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:06,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:05:06,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:07,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:07,115 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:07,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:07,115 INFO L85 PathProgramCache]: Analyzing trace with hash -498964277, now seen corresponding path program 1 times [2022-07-20 06:05:07,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:07,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470252878] [2022-07-20 06:05:07,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:07,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:07,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:07,118 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:07,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-20 06:05:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:07,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:05:07,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:07,236 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-20 06:05:07,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:07,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:07,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470252878] [2022-07-20 06:05:07,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470252878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:07,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:07,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:05:07,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225042806] [2022-07-20 06:05:07,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:07,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:05:07,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:07,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:05:07,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:05:07,241 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:07,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:07,491 INFO L93 Difference]: Finished difference Result 169 states and 188 transitions. [2022-07-20 06:05:07,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:05:07,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 06:05:07,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:07,493 INFO L225 Difference]: With dead ends: 169 [2022-07-20 06:05:07,493 INFO L226 Difference]: Without dead ends: 169 [2022-07-20 06:05:07,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:05:07,493 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 172 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:07,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 162 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:05:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-20 06:05:07,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 150. [2022-07-20 06:05:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 115 states have (on average 1.5043478260869565) internal successors, (173), 149 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 173 transitions. [2022-07-20 06:05:07,515 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 173 transitions. Word has length 16 [2022-07-20 06:05:07,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:07,519 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 173 transitions. [2022-07-20 06:05:07,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 173 transitions. [2022-07-20 06:05:07,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 06:05:07,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:07,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:05:07,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:07,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:07,728 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:07,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:07,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1434057178, now seen corresponding path program 1 times [2022-07-20 06:05:07,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:07,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257900626] [2022-07-20 06:05:07,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:07,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:07,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:07,739 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:07,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-20 06:05:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:07,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:05:07,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:07,938 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 06:05:07,939 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 21 [2022-07-20 06:05:08,063 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-20 06:05:08,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-20 06:05:08,184 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-20 06:05:08,322 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:08,323 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 46 [2022-07-20 06:05:08,377 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 44 treesize of output 28 [2022-07-20 06:05:08,499 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-20 06:05:08,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:08,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:08,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257900626] [2022-07-20 06:05:08,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257900626] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:08,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:08,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:05:08,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750940492] [2022-07-20 06:05:08,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:08,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:05:08,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:08,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:05:08,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:05:08,501 INFO L87 Difference]: Start difference. First operand 150 states and 173 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:09,573 INFO L93 Difference]: Finished difference Result 243 states and 282 transitions. [2022-07-20 06:05:09,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 06:05:09,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 06:05:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:09,574 INFO L225 Difference]: With dead ends: 243 [2022-07-20 06:05:09,574 INFO L226 Difference]: Without dead ends: 243 [2022-07-20 06:05:09,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2022-07-20 06:05:09,575 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 204 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:09,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 349 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 214 Invalid, 0 Unknown, 203 Unchecked, 0.7s Time] [2022-07-20 06:05:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-20 06:05:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 152. [2022-07-20 06:05:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 117 states have (on average 1.5042735042735043) internal successors, (176), 151 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2022-07-20 06:05:09,578 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 18 [2022-07-20 06:05:09,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:09,578 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2022-07-20 06:05:09,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:09,579 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2022-07-20 06:05:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 06:05:09,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:09,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:05:09,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:09,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:09,788 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:09,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:09,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1434057177, now seen corresponding path program 1 times [2022-07-20 06:05:09,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:09,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127648840] [2022-07-20 06:05:09,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:09,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:09,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:09,791 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:09,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-20 06:05:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:09,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 06:05:09,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:09,959 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-20 06:05:09,990 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-20 06:05:10,001 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:05:10,001 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-20 06:05:10,039 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-20 06:05:10,046 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-20 06:05:10,137 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:10,137 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 38 treesize of output 37 [2022-07-20 06:05:10,142 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-20 06:05:10,161 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-20 06:05:10,166 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 15 treesize of output 7 [2022-07-20 06:05:10,220 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-20 06:05:10,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:10,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:10,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127648840] [2022-07-20 06:05:10,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127648840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:10,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:10,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:05:10,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221347870] [2022-07-20 06:05:10,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:10,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:05:10,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:10,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:05:10,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:05:10,223 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:11,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:11,546 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2022-07-20 06:05:11,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:05:11,547 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 06:05:11,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:11,547 INFO L225 Difference]: With dead ends: 144 [2022-07-20 06:05:11,547 INFO L226 Difference]: Without dead ends: 144 [2022-07-20 06:05:11,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:05:11,548 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 166 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:11,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 245 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-20 06:05:11,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-20 06:05:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-07-20 06:05:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 140 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2022-07-20 06:05:11,550 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 18 [2022-07-20 06:05:11,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:11,551 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2022-07-20 06:05:11,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2022-07-20 06:05:11,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 06:05:11,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:11,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:05:11,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:11,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:11,760 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:11,760 INFO L85 PathProgramCache]: Analyzing trace with hash -822008851, now seen corresponding path program 1 times [2022-07-20 06:05:11,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:11,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166136687] [2022-07-20 06:05:11,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:11,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:11,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:11,764 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:11,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-20 06:05:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:11,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:05:11,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:11,872 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-20 06:05:11,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:11,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:11,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166136687] [2022-07-20 06:05:11,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166136687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:11,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:11,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:05:11,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631077316] [2022-07-20 06:05:11,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:11,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:05:11,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:11,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:05:11,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:05:11,874 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:11,891 INFO L93 Difference]: Finished difference Result 167 states and 198 transitions. [2022-07-20 06:05:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:05:11,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-20 06:05:11,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:11,899 INFO L225 Difference]: With dead ends: 167 [2022-07-20 06:05:11,899 INFO L226 Difference]: Without dead ends: 167 [2022-07-20 06:05:11,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:05:11,900 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 21 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:11,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 310 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:05:11,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-20 06:05:11,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 145. [2022-07-20 06:05:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 144 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2022-07-20 06:05:11,911 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 19 [2022-07-20 06:05:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:11,912 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2022-07-20 06:05:11,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2022-07-20 06:05:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 06:05:11,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:11,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:05:11,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:12,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:12,125 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:12,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:12,126 INFO L85 PathProgramCache]: Analyzing trace with hash -913566102, now seen corresponding path program 1 times [2022-07-20 06:05:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:12,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094655632] [2022-07-20 06:05:12,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:12,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:12,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:12,128 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:12,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-20 06:05:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:12,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 06:05:12,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:12,248 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-20 06:05:12,260 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-20 06:05:12,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:05:12,345 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:05:12,345 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 17 treesize of output 10 [2022-07-20 06:05:12,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:05:12,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:05:12,354 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 17 treesize of output 10 [2022-07-20 06:05:12,395 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-20 06:05:12,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:12,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:12,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094655632] [2022-07-20 06:05:12,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094655632] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:12,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:12,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:05:12,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931138011] [2022-07-20 06:05:12,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:12,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:05:12,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:12,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:05:12,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:05:12,397 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:13,743 INFO L93 Difference]: Finished difference Result 270 states and 316 transitions. [2022-07-20 06:05:13,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:05:13,743 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 06:05:13,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:13,744 INFO L225 Difference]: With dead ends: 270 [2022-07-20 06:05:13,744 INFO L226 Difference]: Without dead ends: 270 [2022-07-20 06:05:13,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2022-07-20 06:05:13,745 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 267 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:13,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 430 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-20 06:05:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-20 06:05:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 154. [2022-07-20 06:05:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 130 states have (on average 1.376923076923077) internal successors, (179), 153 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2022-07-20 06:05:13,748 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 21 [2022-07-20 06:05:13,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:13,748 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2022-07-20 06:05:13,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2022-07-20 06:05:13,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 06:05:13,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:13,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:05:13,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:13,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:13,958 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:13,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:13,958 INFO L85 PathProgramCache]: Analyzing trace with hash 332100342, now seen corresponding path program 1 times [2022-07-20 06:05:13,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:13,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871274231] [2022-07-20 06:05:13,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:13,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:13,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:13,964 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:13,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-20 06:05:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:14,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:05:14,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:14,093 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-20 06:05:14,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:14,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:14,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871274231] [2022-07-20 06:05:14,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871274231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:14,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:14,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:05:14,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405407885] [2022-07-20 06:05:14,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:14,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:05:14,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:14,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:05:14,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:05:14,095 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:14,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:14,142 INFO L93 Difference]: Finished difference Result 178 states and 207 transitions. [2022-07-20 06:05:14,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:05:14,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 06:05:14,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:14,144 INFO L225 Difference]: With dead ends: 178 [2022-07-20 06:05:14,144 INFO L226 Difference]: Without dead ends: 178 [2022-07-20 06:05:14,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:05:14,144 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 25 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:14,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 407 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:05:14,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-20 06:05:14,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 158. [2022-07-20 06:05:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 134 states have (on average 1.3656716417910448) internal successors, (183), 157 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2022-07-20 06:05:14,148 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 21 [2022-07-20 06:05:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:14,148 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2022-07-20 06:05:14,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2022-07-20 06:05:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:05:14,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:14,149 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:05:14,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:14,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:14,357 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:14,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:14,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1322487899, now seen corresponding path program 1 times [2022-07-20 06:05:14,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:14,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393071811] [2022-07-20 06:05:14,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:14,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:14,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:14,360 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:14,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-20 06:05:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:14,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 06:05:14,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:14,484 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-20 06:05:14,490 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-20 06:05:14,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:05:14,607 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:05:14,607 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 17 treesize of output 10 [2022-07-20 06:05:14,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:05:14,613 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-20 06:05:14,645 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-20 06:05:14,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:14,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:14,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393071811] [2022-07-20 06:05:14,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393071811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:14,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:14,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:05:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042942397] [2022-07-20 06:05:14,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:14,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:05:14,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:14,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:05:14,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:05:14,648 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:15,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:15,314 INFO L93 Difference]: Finished difference Result 236 states and 267 transitions. [2022-07-20 06:05:15,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:05:15,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 06:05:15,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:15,315 INFO L225 Difference]: With dead ends: 236 [2022-07-20 06:05:15,315 INFO L226 Difference]: Without dead ends: 236 [2022-07-20 06:05:15,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:05:15,316 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 223 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:15,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 353 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 06:05:15,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-20 06:05:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 166. [2022-07-20 06:05:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 165 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 191 transitions. [2022-07-20 06:05:15,319 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 191 transitions. Word has length 23 [2022-07-20 06:05:15,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:15,319 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 191 transitions. [2022-07-20 06:05:15,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 191 transitions. [2022-07-20 06:05:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:05:15,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:15,325 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:05:15,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:15,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:15,532 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:15,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:15,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1609197774, now seen corresponding path program 1 times [2022-07-20 06:05:15,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:15,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482988796] [2022-07-20 06:05:15,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:15,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:15,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:15,547 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:15,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-20 06:05:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:15,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:05:15,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:15,755 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 06:05:15,756 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 21 [2022-07-20 06:05:15,832 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-20 06:05:15,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-20 06:05:15,899 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 13 treesize of output 9 [2022-07-20 06:05:16,054 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:16,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 54 [2022-07-20 06:05:16,364 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 52 treesize of output 28 [2022-07-20 06:05:16,454 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-20 06:05:16,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:16,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:16,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482988796] [2022-07-20 06:05:16,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482988796] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:16,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:16,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:05:16,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724673100] [2022-07-20 06:05:16,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:16,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:05:16,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:16,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:05:16,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:05:16,455 INFO L87 Difference]: Start difference. First operand 166 states and 191 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:17,818 INFO L93 Difference]: Finished difference Result 252 states and 283 transitions. [2022-07-20 06:05:17,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:05:17,819 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 06:05:17,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:17,820 INFO L225 Difference]: With dead ends: 252 [2022-07-20 06:05:17,820 INFO L226 Difference]: Without dead ends: 252 [2022-07-20 06:05:17,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-20 06:05:17,820 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 312 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:17,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 442 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 420 Invalid, 0 Unknown, 71 Unchecked, 1.1s Time] [2022-07-20 06:05:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-07-20 06:05:17,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 177. [2022-07-20 06:05:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 153 states have (on average 1.3398692810457515) internal successors, (205), 176 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2022-07-20 06:05:17,823 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 25 [2022-07-20 06:05:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:17,824 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2022-07-20 06:05:17,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2022-07-20 06:05:17,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:05:17,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:17,824 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:05:17,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:18,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:18,035 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:18,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:18,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1609197773, now seen corresponding path program 1 times [2022-07-20 06:05:18,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:18,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261905157] [2022-07-20 06:05:18,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:18,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:18,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:18,043 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:18,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-20 06:05:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:18,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 06:05:18,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:18,245 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-20 06:05:18,269 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-20 06:05:18,292 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:05:18,293 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-20 06:05:18,319 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 13 treesize of output 9 [2022-07-20 06:05:18,327 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-20 06:05:18,423 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:18,423 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 46 treesize of output 45 [2022-07-20 06:05:18,433 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 22 treesize of output 24 [2022-07-20 06:05:18,595 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-20 06:05:18,599 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-20 06:05:18,630 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-20 06:05:18,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:18,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:18,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261905157] [2022-07-20 06:05:18,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261905157] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:18,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:18,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:05:18,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014516508] [2022-07-20 06:05:18,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:18,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:05:18,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:18,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:05:18,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:05:18,631 INFO L87 Difference]: Start difference. First operand 177 states and 205 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:19,703 INFO L93 Difference]: Finished difference Result 260 states and 294 transitions. [2022-07-20 06:05:19,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:05:19,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 06:05:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:19,705 INFO L225 Difference]: With dead ends: 260 [2022-07-20 06:05:19,705 INFO L226 Difference]: Without dead ends: 260 [2022-07-20 06:05:19,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:05:19,706 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 201 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:19,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 410 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-20 06:05:19,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-20 06:05:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 177. [2022-07-20 06:05:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 153 states have (on average 1.3333333333333333) internal successors, (204), 176 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:19,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 204 transitions. [2022-07-20 06:05:19,709 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 204 transitions. Word has length 25 [2022-07-20 06:05:19,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:19,709 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 204 transitions. [2022-07-20 06:05:19,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 204 transitions. [2022-07-20 06:05:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:05:19,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:19,709 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:05:19,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:19,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:19,917 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:19,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1346931026, now seen corresponding path program 1 times [2022-07-20 06:05:19,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:19,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103038236] [2022-07-20 06:05:19,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:19,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:19,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:19,919 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:19,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-20 06:05:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:20,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:05:20,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:20,100 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-20 06:05:20,107 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-20 06:05:20,121 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 21 treesize of output 9 [2022-07-20 06:05:20,141 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-20 06:05:20,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:20,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:20,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103038236] [2022-07-20 06:05:20,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103038236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:20,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:20,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:05:20,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133103929] [2022-07-20 06:05:20,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:20,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:05:20,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:20,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:05:20,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:05:20,145 INFO L87 Difference]: Start difference. First operand 177 states and 204 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:20,680 INFO L93 Difference]: Finished difference Result 185 states and 213 transitions. [2022-07-20 06:05:20,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:05:20,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 06:05:20,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:20,682 INFO L225 Difference]: With dead ends: 185 [2022-07-20 06:05:20,682 INFO L226 Difference]: Without dead ends: 185 [2022-07-20 06:05:20,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:05:20,682 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 9 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:20,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 282 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 06:05:20,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-20 06:05:20,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 176. [2022-07-20 06:05:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 153 states have (on average 1.326797385620915) internal successors, (203), 175 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 203 transitions. [2022-07-20 06:05:20,685 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 203 transitions. Word has length 25 [2022-07-20 06:05:20,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:20,685 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 203 transitions. [2022-07-20 06:05:20,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:20,685 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 203 transitions. [2022-07-20 06:05:20,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:05:20,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:20,686 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:05:20,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:20,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:20,903 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:20,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1346931027, now seen corresponding path program 1 times [2022-07-20 06:05:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:20,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476092342] [2022-07-20 06:05:20,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:20,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:20,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:20,908 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:20,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-20 06:05:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:21,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 06:05:21,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:21,083 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-20 06:05:21,096 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-20 06:05:21,103 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-20 06:05:21,140 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 21 treesize of output 9 [2022-07-20 06:05:21,143 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 7 [2022-07-20 06:05:21,175 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-20 06:05:21,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:21,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:21,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476092342] [2022-07-20 06:05:21,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476092342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:21,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:21,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:05:21,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332972415] [2022-07-20 06:05:21,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:21,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:05:21,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:21,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:05:21,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:05:21,178 INFO L87 Difference]: Start difference. First operand 176 states and 203 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:21,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:21,823 INFO L93 Difference]: Finished difference Result 175 states and 202 transitions. [2022-07-20 06:05:21,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:05:21,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 06:05:21,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:21,825 INFO L225 Difference]: With dead ends: 175 [2022-07-20 06:05:21,825 INFO L226 Difference]: Without dead ends: 175 [2022-07-20 06:05:21,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:05:21,825 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 2 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:21,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 273 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 06:05:21,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-20 06:05:21,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-07-20 06:05:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 153 states have (on average 1.3202614379084967) internal successors, (202), 174 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 202 transitions. [2022-07-20 06:05:21,828 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 202 transitions. Word has length 25 [2022-07-20 06:05:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:21,828 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 202 transitions. [2022-07-20 06:05:21,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 202 transitions. [2022-07-20 06:05:21,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:05:21,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:21,829 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:05:21,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:22,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:22,038 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:22,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:22,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1459618013, now seen corresponding path program 1 times [2022-07-20 06:05:22,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:22,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088386425] [2022-07-20 06:05:22,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:22,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:22,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:22,041 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:22,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-20 06:05:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:22,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-20 06:05:22,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:22,181 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-20 06:05:22,193 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-20 06:05:22,224 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:05:22,225 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-20 06:05:22,264 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 13 treesize of output 9 [2022-07-20 06:05:22,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:05:22,271 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 23 treesize of output 22 [2022-07-20 06:05:22,317 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 20 treesize of output 8 [2022-07-20 06:05:22,345 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-20 06:05:22,410 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 7 [2022-07-20 06:05:22,446 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-20 06:05:22,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:22,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:22,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088386425] [2022-07-20 06:05:22,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088386425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:22,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:22,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:05:22,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472834372] [2022-07-20 06:05:22,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:22,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:05:22,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:22,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:05:22,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:05:22,448 INFO L87 Difference]: Start difference. First operand 175 states and 202 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:24,029 INFO L93 Difference]: Finished difference Result 255 states and 285 transitions. [2022-07-20 06:05:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:05:24,031 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 06:05:24,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:24,031 INFO L225 Difference]: With dead ends: 255 [2022-07-20 06:05:24,031 INFO L226 Difference]: Without dead ends: 255 [2022-07-20 06:05:24,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:05:24,032 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 273 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:24,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 653 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-20 06:05:24,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-20 06:05:24,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 175. [2022-07-20 06:05:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 153 states have (on average 1.3137254901960784) internal successors, (201), 174 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 201 transitions. [2022-07-20 06:05:24,035 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 201 transitions. Word has length 27 [2022-07-20 06:05:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:24,035 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 201 transitions. [2022-07-20 06:05:24,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 201 transitions. [2022-07-20 06:05:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:05:24,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:24,036 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:05:24,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:24,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:24,252 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:24,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:24,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1491473498, now seen corresponding path program 1 times [2022-07-20 06:05:24,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:24,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366751775] [2022-07-20 06:05:24,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:24,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:24,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:24,256 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:24,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-20 06:05:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:24,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 06:05:24,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:24,383 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-20 06:05:24,386 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-20 06:05:24,428 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 06:05:24,428 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 21 treesize of output 20 [2022-07-20 06:05:24,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:05:24,434 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 21 treesize of output 20 [2022-07-20 06:05:24,466 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 06:05:24,467 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 21 treesize of output 20 [2022-07-20 06:05:24,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:05:24,472 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 21 treesize of output 20 [2022-07-20 06:05:24,494 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 06:05:24,494 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 21 treesize of output 20 [2022-07-20 06:05:24,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:05:24,508 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 21 treesize of output 20 [2022-07-20 06:05:24,598 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-20 06:05:24,600 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-20 06:05:24,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:05:24,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:05:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:05:24,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:24,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366751775] [2022-07-20 06:05:24,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366751775] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:05:24,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:05:24,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-20 06:05:24,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800000688] [2022-07-20 06:05:24,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:05:24,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:05:24,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:24,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:05:24,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:05:24,746 INFO L87 Difference]: Start difference. First operand 175 states and 201 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:25,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:25,205 INFO L93 Difference]: Finished difference Result 215 states and 244 transitions. [2022-07-20 06:05:25,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:05:25,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 06:05:25,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:25,206 INFO L225 Difference]: With dead ends: 215 [2022-07-20 06:05:25,207 INFO L226 Difference]: Without dead ends: 215 [2022-07-20 06:05:25,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:05:25,207 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 80 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:25,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 277 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:05:25,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-20 06:05:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 188. [2022-07-20 06:05:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 187 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 216 transitions. [2022-07-20 06:05:25,210 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 216 transitions. Word has length 27 [2022-07-20 06:05:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:25,210 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 216 transitions. [2022-07-20 06:05:25,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2022-07-20 06:05:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:05:25,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:25,211 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:05:25,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-20 06:05:25,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:25,419 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:25,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:25,419 INFO L85 PathProgramCache]: Analyzing trace with hash -834479840, now seen corresponding path program 1 times [2022-07-20 06:05:25,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:25,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055975525] [2022-07-20 06:05:25,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:25,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:25,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:25,422 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:25,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-20 06:05:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:25,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 06:05:25,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:25,714 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 7 [2022-07-20 06:05:25,718 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 7 [2022-07-20 06:05:25,741 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-20 06:05:25,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:25,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:25,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055975525] [2022-07-20 06:05:25,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055975525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:25,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:25,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:05:25,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474312295] [2022-07-20 06:05:25,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:25,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:05:25,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:25,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:05:25,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:05:25,743 INFO L87 Difference]: Start difference. First operand 188 states and 216 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:26,675 INFO L93 Difference]: Finished difference Result 221 states and 244 transitions. [2022-07-20 06:05:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:05:26,676 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 06:05:26,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:26,676 INFO L225 Difference]: With dead ends: 221 [2022-07-20 06:05:26,677 INFO L226 Difference]: Without dead ends: 221 [2022-07-20 06:05:26,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2022-07-20 06:05:26,678 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 196 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:26,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 480 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 06:05:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-20 06:05:26,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 190. [2022-07-20 06:05:26,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 168 states have (on average 1.2976190476190477) internal successors, (218), 189 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 218 transitions. [2022-07-20 06:05:26,681 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 218 transitions. Word has length 29 [2022-07-20 06:05:26,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:26,681 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 218 transitions. [2022-07-20 06:05:26,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:26,681 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2022-07-20 06:05:26,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:05:26,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:26,682 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:05:26,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-20 06:05:26,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:26,890 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:26,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:26,891 INFO L85 PathProgramCache]: Analyzing trace with hash 935468470, now seen corresponding path program 1 times [2022-07-20 06:05:26,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:26,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583182598] [2022-07-20 06:05:26,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:26,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:26,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:26,893 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:26,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-20 06:05:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:27,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 06:05:27,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:27,092 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-20 06:05:27,123 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:05:27,124 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 24 [2022-07-20 06:05:27,138 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-20 06:05:27,176 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:27,176 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-20 06:05:27,186 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-20 06:05:27,268 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-20 06:05:27,268 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 24 treesize of output 41 [2022-07-20 06:05:27,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:05:27,404 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:27,405 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-07-20 06:05:27,437 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 33 treesize of output 17 [2022-07-20 06:05:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:05:27,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:27,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:27,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583182598] [2022-07-20 06:05:27,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583182598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:27,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:27,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-20 06:05:27,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263551377] [2022-07-20 06:05:27,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:27,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 06:05:27,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:27,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 06:05:27,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:05:27,529 INFO L87 Difference]: Start difference. First operand 190 states and 218 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:28,053 INFO L93 Difference]: Finished difference Result 209 states and 235 transitions. [2022-07-20 06:05:28,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 06:05:28,053 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-20 06:05:28,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:28,054 INFO L225 Difference]: With dead ends: 209 [2022-07-20 06:05:28,054 INFO L226 Difference]: Without dead ends: 209 [2022-07-20 06:05:28,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2022-07-20 06:05:28,055 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 144 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:28,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 318 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 207 Invalid, 0 Unknown, 236 Unchecked, 0.3s Time] [2022-07-20 06:05:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-20 06:05:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 191. [2022-07-20 06:05:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 169 states have (on average 1.301775147928994) internal successors, (220), 190 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2022-07-20 06:05:28,057 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 31 [2022-07-20 06:05:28,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:28,057 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2022-07-20 06:05:28,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2022-07-20 06:05:28,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:05:28,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:28,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:05:28,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:28,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:28,277 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:28,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:28,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1094686802, now seen corresponding path program 1 times [2022-07-20 06:05:28,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:28,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889008353] [2022-07-20 06:05:28,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:28,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:28,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:28,280 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:28,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-20 06:05:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:28,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 06:05:28,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:28,521 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:05:28,521 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 24 [2022-07-20 06:05:28,538 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-20 06:05:28,655 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:28,655 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-20 06:05:28,675 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-20 06:05:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:05:28,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:28,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:28,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889008353] [2022-07-20 06:05:28,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889008353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:28,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:28,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:05:28,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105178346] [2022-07-20 06:05:28,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:28,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:05:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:28,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:05:28,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:05:28,710 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:28,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:28,906 INFO L93 Difference]: Finished difference Result 207 states and 239 transitions. [2022-07-20 06:05:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:05:28,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-20 06:05:28,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:28,907 INFO L225 Difference]: With dead ends: 207 [2022-07-20 06:05:28,907 INFO L226 Difference]: Without dead ends: 207 [2022-07-20 06:05:28,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:05:28,908 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 62 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:28,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 238 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 156 Unchecked, 0.2s Time] [2022-07-20 06:05:28,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-20 06:05:28,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2022-07-20 06:05:28,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 160 states have (on average 1.30625) internal successors, (209), 180 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 209 transitions. [2022-07-20 06:05:28,916 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 209 transitions. Word has length 31 [2022-07-20 06:05:28,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:28,916 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 209 transitions. [2022-07-20 06:05:28,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:28,916 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 209 transitions. [2022-07-20 06:05:28,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 06:05:28,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:28,917 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:05:28,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:29,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:29,121 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:29,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:29,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1955979153, now seen corresponding path program 1 times [2022-07-20 06:05:29,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:29,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718069576] [2022-07-20 06:05:29,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:29,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:29,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:29,124 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:29,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-20 06:05:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:29,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 06:05:29,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:29,267 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-20 06:05:29,285 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:05:29,286 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-20 06:05:29,294 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 13 treesize of output 9 [2022-07-20 06:05:29,344 INFO L356 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-07-20 06:05:29,344 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 69 treesize of output 47 [2022-07-20 06:05:29,348 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-07-20 06:05:29,506 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-20 06:05:29,506 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 87 treesize of output 40 [2022-07-20 06:05:29,509 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 10 [2022-07-20 06:05:29,556 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-20 06:05:29,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:29,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:29,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718069576] [2022-07-20 06:05:29,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718069576] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:29,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:29,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 06:05:29,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634404107] [2022-07-20 06:05:29,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:29,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 06:05:29,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:29,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 06:05:29,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:05:29,557 INFO L87 Difference]: Start difference. First operand 181 states and 209 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:30,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:30,775 INFO L93 Difference]: Finished difference Result 262 states and 291 transitions. [2022-07-20 06:05:30,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:05:30,775 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-20 06:05:30,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:30,776 INFO L225 Difference]: With dead ends: 262 [2022-07-20 06:05:30,776 INFO L226 Difference]: Without dead ends: 262 [2022-07-20 06:05:30,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-07-20 06:05:30,777 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 157 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:30,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 676 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 634 Invalid, 0 Unknown, 88 Unchecked, 0.9s Time] [2022-07-20 06:05:30,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-20 06:05:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 178. [2022-07-20 06:05:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 157 states have (on average 1.2993630573248407) internal successors, (204), 177 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 204 transitions. [2022-07-20 06:05:30,779 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 204 transitions. Word has length 32 [2022-07-20 06:05:30,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:30,779 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 204 transitions. [2022-07-20 06:05:30,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 204 transitions. [2022-07-20 06:05:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:05:30,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:30,780 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:05:30,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:30,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:30,987 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:30,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:30,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1694086802, now seen corresponding path program 1 times [2022-07-20 06:05:30,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:30,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174631396] [2022-07-20 06:05:30,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:30,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:30,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:30,989 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:30,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-20 06:05:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:31,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 06:05:31,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:31,203 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 20 treesize of output 8 [2022-07-20 06:05:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:05:31,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:05:31,290 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-20 06:05:31,290 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 20 treesize of output 15 [2022-07-20 06:05:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:05:31,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:31,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174631396] [2022-07-20 06:05:31,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174631396] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:05:31,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:05:31,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-07-20 06:05:31,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744374447] [2022-07-20 06:05:31,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:05:31,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:05:31,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:31,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:05:31,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:05:31,300 INFO L87 Difference]: Start difference. First operand 178 states and 204 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:34,006 INFO L93 Difference]: Finished difference Result 269 states and 297 transitions. [2022-07-20 06:05:34,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:05:34,006 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:05:34,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:34,007 INFO L225 Difference]: With dead ends: 269 [2022-07-20 06:05:34,007 INFO L226 Difference]: Without dead ends: 269 [2022-07-20 06:05:34,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2022-07-20 06:05:34,008 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 281 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:34,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 455 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 06:05:34,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-20 06:05:34,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 220. [2022-07-20 06:05:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 199 states have (on average 1.3015075376884422) internal successors, (259), 219 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 259 transitions. [2022-07-20 06:05:34,012 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 259 transitions. Word has length 34 [2022-07-20 06:05:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:34,012 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 259 transitions. [2022-07-20 06:05:34,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 259 transitions. [2022-07-20 06:05:34,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:05:34,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:34,012 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:05:34,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:34,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:34,220 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:34,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:34,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1694075817, now seen corresponding path program 1 times [2022-07-20 06:05:34,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:34,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507095239] [2022-07-20 06:05:34,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:34,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:34,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:34,222 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:34,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-20 06:05:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:34,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:05:34,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:05:34,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:05:34,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:34,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507095239] [2022-07-20 06:05:34,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507095239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:05:34,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:05:34,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:05:34,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996169213] [2022-07-20 06:05:34,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:05:34,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:05:34,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:34,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:05:34,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:05:34,476 INFO L87 Difference]: Start difference. First operand 220 states and 259 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:34,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:34,728 INFO L93 Difference]: Finished difference Result 245 states and 278 transitions. [2022-07-20 06:05:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:05:34,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:05:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:34,729 INFO L225 Difference]: With dead ends: 245 [2022-07-20 06:05:34,729 INFO L226 Difference]: Without dead ends: 245 [2022-07-20 06:05:34,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:05:34,730 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 195 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:34,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 131 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:05:34,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-20 06:05:34,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 222. [2022-07-20 06:05:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 201 states have (on average 1.2985074626865671) internal successors, (261), 221 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 261 transitions. [2022-07-20 06:05:34,733 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 261 transitions. Word has length 34 [2022-07-20 06:05:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:34,733 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 261 transitions. [2022-07-20 06:05:34,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:34,733 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 261 transitions. [2022-07-20 06:05:34,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:05:34,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:34,734 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:05:34,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:34,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:34,942 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:34,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:34,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1837503706, now seen corresponding path program 1 times [2022-07-20 06:05:34,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:34,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192833883] [2022-07-20 06:05:34,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:34,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:34,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:34,948 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:34,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-20 06:05:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:35,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 06:05:35,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:35,180 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-20 06:05:35,202 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-20 06:05:35,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:05:35,226 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 23 treesize of output 22 [2022-07-20 06:05:35,272 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:05:35,273 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-20 06:05:35,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:05:35,297 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 21 treesize of output 20 [2022-07-20 06:05:35,305 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-20 06:05:35,392 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:35,393 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 29 treesize of output 30 [2022-07-20 06:05:35,397 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 20 treesize of output 22 [2022-07-20 06:05:35,426 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 16 treesize of output 8 [2022-07-20 06:05:35,459 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-20 06:05:35,491 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-20 06:05:35,510 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-20 06:05:35,558 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-20 06:05:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:05:35,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:05:35,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1087 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1087) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))))) is different from false [2022-07-20 06:05:35,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1087 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1087) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32)))) is different from false [2022-07-20 06:05:35,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1087 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1087) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))))) is different from false [2022-07-20 06:05:35,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1087 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1083) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1084) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1087) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))))) is different from false [2022-07-20 06:05:35,767 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1087 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1083) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1084) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1087)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))))) is different from false [2022-07-20 06:05:35,779 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:05:35,780 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 39 treesize of output 40 [2022-07-20 06:05:35,783 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 73 treesize of output 65 [2022-07-20 06:05:35,791 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 26 treesize of output 24 [2022-07-20 06:05:35,798 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc7#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (or (not .cse0) (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1082 (_ BitVec 32)) (v_ArrVal_1087 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_95 (_ BitVec 32))) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1082)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1083) v_arrayElimCell_95 v_ArrVal_1087) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))))))) (or (forall ((v_ArrVal_1082 (_ BitVec 32)) (v_ArrVal_1087 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1082)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1087) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))))) .cse0))) is different from false [2022-07-20 06:05:36,019 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 8 treesize of output 4 [2022-07-20 06:05:36,028 INFO L356 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-07-20 06:05:36,028 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 26 treesize of output 1 [2022-07-20 06:05:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:05:36,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:36,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192833883] [2022-07-20 06:05:36,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192833883] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:05:36,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:05:36,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2022-07-20 06:05:36,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664349307] [2022-07-20 06:05:36,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:05:36,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 06:05:36,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:36,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 06:05:36,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=310, Unknown=10, NotChecked=246, Total=650 [2022-07-20 06:05:36,057 INFO L87 Difference]: Start difference. First operand 222 states and 261 transitions. Second operand has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:41,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:41,849 INFO L93 Difference]: Finished difference Result 456 states and 515 transitions. [2022-07-20 06:05:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-20 06:05:41,850 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:05:41,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:41,851 INFO L225 Difference]: With dead ends: 456 [2022-07-20 06:05:41,851 INFO L226 Difference]: Without dead ends: 456 [2022-07-20 06:05:41,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=374, Invalid=1446, Unknown=10, NotChecked=522, Total=2352 [2022-07-20 06:05:41,853 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 494 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1335 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:41,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 892 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 741 Invalid, 0 Unknown, 1335 Unchecked, 1.0s Time] [2022-07-20 06:05:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-07-20 06:05:41,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 254. [2022-07-20 06:05:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 233 states have (on average 1.2832618025751072) internal successors, (299), 253 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 299 transitions. [2022-07-20 06:05:41,858 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 299 transitions. Word has length 34 [2022-07-20 06:05:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:41,859 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 299 transitions. [2022-07-20 06:05:41,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 299 transitions. [2022-07-20 06:05:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:05:41,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:41,859 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:05:41,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:42,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:42,069 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:42,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:42,069 INFO L85 PathProgramCache]: Analyzing trace with hash 601359066, now seen corresponding path program 1 times [2022-07-20 06:05:42,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:42,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210819083] [2022-07-20 06:05:42,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:42,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:42,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:42,071 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:42,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-20 06:05:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:42,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 06:05:42,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:42,307 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-20 06:05:42,327 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-20 06:05:42,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:05:42,343 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 23 treesize of output 22 [2022-07-20 06:05:42,376 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:05:42,376 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-20 06:05:42,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:05:42,406 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 21 treesize of output 20 [2022-07-20 06:05:42,412 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-20 06:05:42,483 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:42,484 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 29 treesize of output 30 [2022-07-20 06:05:42,487 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 20 treesize of output 22 [2022-07-20 06:05:42,505 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 16 treesize of output 8 [2022-07-20 06:05:42,543 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-20 06:05:42,560 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-20 06:05:42,568 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-20 06:05:42,604 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-20 06:05:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:05:42,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:05:42,711 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1159) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32)))) is different from false [2022-07-20 06:05:42,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1159) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))))) is different from false [2022-07-20 06:05:42,734 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1159) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32)))) is different from false [2022-07-20 06:05:42,745 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1156 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1155) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1156) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1159) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))))) is different from false [2022-07-20 06:05:42,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1156 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1155) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1156) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1159)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))))) is different from false [2022-07-20 06:05:42,766 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:05:42,766 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 39 treesize of output 40 [2022-07-20 06:05:42,768 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 73 treesize of output 65 [2022-07-20 06:05:42,773 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 26 treesize of output 24 [2022-07-20 06:05:48,782 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 8 treesize of output 4 [2022-07-20 06:05:48,789 INFO L356 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-07-20 06:05:48,789 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 26 treesize of output 1 [2022-07-20 06:05:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:05:48,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:48,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210819083] [2022-07-20 06:05:48,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210819083] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:05:48,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:05:48,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2022-07-20 06:05:48,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720770069] [2022-07-20 06:05:48,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:05:48,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 06:05:48,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:48,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 06:05:48,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=342, Unknown=13, NotChecked=210, Total=650 [2022-07-20 06:05:48,819 INFO L87 Difference]: Start difference. First operand 254 states and 299 transitions. Second operand has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:52,243 INFO L93 Difference]: Finished difference Result 336 states and 386 transitions. [2022-07-20 06:05:52,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-20 06:05:52,244 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:05:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:52,245 INFO L225 Difference]: With dead ends: 336 [2022-07-20 06:05:52,245 INFO L226 Difference]: Without dead ends: 336 [2022-07-20 06:05:52,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=168, Invalid=708, Unknown=14, NotChecked=300, Total=1190 [2022-07-20 06:05:52,246 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 127 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 927 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:52,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 959 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 683 Invalid, 0 Unknown, 927 Unchecked, 1.0s Time] [2022-07-20 06:05:52,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-07-20 06:05:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 242. [2022-07-20 06:05:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 221 states have (on average 1.2850678733031675) internal successors, (284), 241 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 284 transitions. [2022-07-20 06:05:52,249 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 284 transitions. Word has length 34 [2022-07-20 06:05:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:52,249 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 284 transitions. [2022-07-20 06:05:52,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 284 transitions. [2022-07-20 06:05:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:05:52,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:52,249 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:05:52,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:52,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:52,450 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:52,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:52,450 INFO L85 PathProgramCache]: Analyzing trace with hash -599280949, now seen corresponding path program 1 times [2022-07-20 06:05:52,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:52,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306988483] [2022-07-20 06:05:52,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:52,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:52,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:52,464 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:52,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-20 06:05:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:52,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-20 06:05:52,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:52,691 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-20 06:05:52,720 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-20 06:05:52,725 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-20 06:05:52,776 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:05:52,777 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-20 06:05:52,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:05:52,806 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 21 treesize of output 20 [2022-07-20 06:05:52,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:05:52,816 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 21 treesize of output 20 [2022-07-20 06:05:52,900 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:52,900 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:05:52,904 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 20 treesize of output 22 [2022-07-20 06:05:52,994 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:52,994 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 29 [2022-07-20 06:05:53,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:05:53,008 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-20 06:05:53,042 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:05:53,042 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 16 treesize of output 22 [2022-07-20 06:05:53,046 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 7 treesize of output 3 [2022-07-20 06:05:53,062 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:53,062 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 29 [2022-07-20 06:05:53,092 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:53,092 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 38 treesize of output 37 [2022-07-20 06:05:53,096 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 20 treesize of output 22 [2022-07-20 06:05:53,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:05:53,202 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:05:53,202 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 17 treesize of output 10 [2022-07-20 06:05:53,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:05:53,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:05:53,213 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:05:53,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 14 [2022-07-20 06:05:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:05:53,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:05:53,359 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1234) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (forall ((v_ArrVal_1233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1233) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2022-07-20 06:05:53,384 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1234) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (forall ((v_ArrVal_1233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1233) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-20 06:05:53,392 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1234 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1234) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (forall ((v_ArrVal_1233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1233) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-20 06:05:53,410 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1228) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1227) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1234) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (forall ((v_ArrVal_1233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1227))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1233)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-20 06:05:53,424 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1227))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1233)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (forall ((v_ArrVal_1234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1228) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1227) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1234)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-20 06:05:53,456 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1225 (_ BitVec 32)) (v_ArrVal_1234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1225)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1228) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1227) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1234) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1227))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1233)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-20 06:05:53,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_12| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1225 (_ BitVec 32)) (v_ArrVal_1234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1225)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_1228) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_1227) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1234) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (forall ((v_ArrVal_1233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_1227))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1233)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|))))) is different from false [2022-07-20 06:05:53,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_12| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1225 (_ BitVec 32)) (v_ArrVal_1234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1225)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_1228) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_1227) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1234) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (forall ((v_ArrVal_1233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_1227))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1233)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|))))) is different from false [2022-07-20 06:05:53,561 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-20 06:05:53,561 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 2 case distinctions, treesize of input 48 treesize of output 54 [2022-07-20 06:05:53,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:05:53,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:05:53,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 35 treesize of output 41 [2022-07-20 06:05:53,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:05:53,579 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 64 treesize of output 50 [2022-07-20 06:05:53,585 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 188 treesize of output 164 [2022-07-20 06:05:53,591 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 114 treesize of output 98 [2022-07-20 06:05:53,594 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 86 [2022-07-20 06:05:53,616 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 86 treesize of output 78 [2022-07-20 06:05:53,630 INFO L356 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-07-20 06:05:53,630 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 48 treesize of output 1 [2022-07-20 06:05:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 06:05:53,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:53,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306988483] [2022-07-20 06:05:53,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306988483] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:05:53,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:05:53,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2022-07-20 06:05:53,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132958307] [2022-07-20 06:05:53,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:05:53,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 06:05:53,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:53,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 06:05:53,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=254, Unknown=8, NotChecked=312, Total=650 [2022-07-20 06:05:53,676 INFO L87 Difference]: Start difference. First operand 242 states and 284 transitions. Second operand has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:53,858 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (and (= (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_12| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1225 (_ BitVec 32)) (v_ArrVal_1234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1225)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_1228) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_1227) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1234) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (forall ((v_ArrVal_1233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_1227))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1233)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)))) is different from false [2022-07-20 06:05:55,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:55,411 INFO L93 Difference]: Finished difference Result 336 states and 381 transitions. [2022-07-20 06:05:55,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 06:05:55,412 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 06:05:55,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:55,413 INFO L225 Difference]: With dead ends: 336 [2022-07-20 06:05:55,413 INFO L226 Difference]: Without dead ends: 336 [2022-07-20 06:05:55,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=215, Invalid=682, Unknown=9, NotChecked=576, Total=1482 [2022-07-20 06:05:55,414 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 338 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1386 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:55,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 706 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 779 Invalid, 0 Unknown, 1386 Unchecked, 1.1s Time] [2022-07-20 06:05:55,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-07-20 06:05:55,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 249. [2022-07-20 06:05:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 228 states have (on average 1.2763157894736843) internal successors, (291), 248 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 291 transitions. [2022-07-20 06:05:55,417 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 291 transitions. Word has length 36 [2022-07-20 06:05:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:55,417 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 291 transitions. [2022-07-20 06:05:55,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 291 transitions. [2022-07-20 06:05:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 06:05:55,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:55,417 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:05:55,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:55,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:55,618 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:55,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:55,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1948285357, now seen corresponding path program 1 times [2022-07-20 06:05:55,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:55,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496064537] [2022-07-20 06:05:55,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:55,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:55,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:55,623 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:55,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-20 06:05:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:55,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:05:55,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:55,890 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-20 06:05:55,892 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-20 06:05:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:05:55,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:05:55,991 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-20 06:05:55,991 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 24 treesize of output 23 [2022-07-20 06:05:55,996 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-20 06:05:55,996 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 20 treesize of output 12 [2022-07-20 06:05:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:05:56,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:05:56,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496064537] [2022-07-20 06:05:56,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496064537] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:05:56,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:05:56,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2022-07-20 06:05:56,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482003428] [2022-07-20 06:05:56,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:05:56,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:05:56,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:05:56,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:05:56,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:05:56,024 INFO L87 Difference]: Start difference. First operand 249 states and 291 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:56,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:05:56,887 INFO L93 Difference]: Finished difference Result 350 states and 406 transitions. [2022-07-20 06:05:56,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:05:56,887 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-20 06:05:56,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:05:56,888 INFO L225 Difference]: With dead ends: 350 [2022-07-20 06:05:56,888 INFO L226 Difference]: Without dead ends: 350 [2022-07-20 06:05:56,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-07-20 06:05:56,889 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 240 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 06:05:56,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 560 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-20 06:05:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-07-20 06:05:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 276. [2022-07-20 06:05:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 255 states have (on average 1.2745098039215685) internal successors, (325), 275 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 325 transitions. [2022-07-20 06:05:56,892 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 325 transitions. Word has length 37 [2022-07-20 06:05:56,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:05:56,892 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 325 transitions. [2022-07-20 06:05:56,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:05:56,893 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 325 transitions. [2022-07-20 06:05:56,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:05:56,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:05:56,893 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:05:56,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-20 06:05:57,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:05:57,093 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:05:57,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:05:57,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1749935854, now seen corresponding path program 1 times [2022-07-20 06:05:57,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:05:57,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565051244] [2022-07-20 06:05:57,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:05:57,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:05:57,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:05:57,095 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:05:57,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-20 06:05:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:05:57,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 06:05:57,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:05:57,332 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-20 06:05:57,361 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:05:57,361 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 24 [2022-07-20 06:05:57,382 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 13 treesize of output 9 [2022-07-20 06:05:57,437 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:57,437 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 37 treesize of output 38 [2022-07-20 06:05:57,508 INFO L356 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2022-07-20 06:05:57,508 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 34 treesize of output 57 [2022-07-20 06:05:57,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:05:57,583 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 46 treesize of output 33 [2022-07-20 06:05:57,764 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:57,764 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 52 [2022-07-20 06:05:57,975 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:57,976 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 60 treesize of output 52 [2022-07-20 06:05:58,053 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:58,067 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 60 treesize of output 52 [2022-07-20 06:05:58,104 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:05:58,104 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 57 treesize of output 52 [2022-07-20 06:05:58,372 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 48 treesize of output 24 [2022-07-20 06:05:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:05:58,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:05:58,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1336))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1339)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-20 06:05:58,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1336))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1339)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (_ bv1 1))) is different from false [2022-07-20 06:05:58,665 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1339 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1336))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1339)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (_ bv1 1))) is different from false [2022-07-20 06:05:58,681 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1333 (_ BitVec 1)) (v_ArrVal_1339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (_ bv0 1))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1333) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1336))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1339)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2022-07-20 06:05:58,702 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1333 (_ BitVec 1)) (v_ArrVal_1339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (_ bv0 1))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1333) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1336))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1339)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2022-07-20 06:05:58,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1333 (_ BitVec 1)) (v_ArrVal_1339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (_ bv0 1))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1333) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1332))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1336))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1339)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2022-07-20 06:05:58,783 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_1332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1333 (_ BitVec 1)) (v_ArrVal_1339 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1333) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) v_ArrVal_1332))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1336))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1339)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (_ bv0 1))))) is different from false [2022-07-20 06:05:58,815 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:05:58,819 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 95 treesize of output 66 [2022-07-20 06:05:58,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:05:58,828 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 90 treesize of output 78 [2022-07-20 06:05:58,831 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 74 treesize of output 66 [2022-07-20 06:05:58,850 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 34 treesize of output 30 [2022-07-20 06:06:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 06:06:01,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:06:01,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565051244] [2022-07-20 06:06:01,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565051244] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:06:01,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:06:01,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2022-07-20 06:06:01,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529029363] [2022-07-20 06:06:01,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:06:01,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 06:06:01,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:06:01,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 06:06:01,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=408, Unknown=10, NotChecked=336, Total=870 [2022-07-20 06:06:01,075 INFO L87 Difference]: Start difference. First operand 276 states and 325 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:06:02,212 INFO L93 Difference]: Finished difference Result 401 states and 464 transitions. [2022-07-20 06:06:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 06:06:02,213 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 06:06:02,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:06:02,214 INFO L225 Difference]: With dead ends: 401 [2022-07-20 06:06:02,214 INFO L226 Difference]: Without dead ends: 401 [2022-07-20 06:06:02,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=219, Invalid=791, Unknown=10, NotChecked=462, Total=1482 [2022-07-20 06:06:02,214 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 191 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1917 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:06:02,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1156 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 388 Invalid, 0 Unknown, 1917 Unchecked, 0.6s Time] [2022-07-20 06:06:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-07-20 06:06:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 300. [2022-07-20 06:06:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 279 states have (on average 1.2724014336917562) internal successors, (355), 299 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 355 transitions. [2022-07-20 06:06:02,218 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 355 transitions. Word has length 38 [2022-07-20 06:06:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:06:02,218 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 355 transitions. [2022-07-20 06:06:02,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 355 transitions. [2022-07-20 06:06:02,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:06:02,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:06:02,218 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:06:02,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-20 06:06:02,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:06:02,435 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:06:02,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:06:02,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1749935853, now seen corresponding path program 1 times [2022-07-20 06:06:02,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:06:02,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931367122] [2022-07-20 06:06:02,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:06:02,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:06:02,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:06:02,440 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:06:02,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-20 06:06:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:06:02,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-20 06:06:02,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:06:02,689 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-20 06:06:02,711 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-20 06:06:02,729 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:06:02,729 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 24 [2022-07-20 06:06:02,755 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 13 treesize of output 9 [2022-07-20 06:06:02,768 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-20 06:06:02,857 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:02,857 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 60 treesize of output 57 [2022-07-20 06:06:02,873 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 22 treesize of output 24 [2022-07-20 06:06:02,948 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-20 06:06:02,949 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 1 case distinctions, treesize of input 18 treesize of output 30 [2022-07-20 06:06:02,970 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-20 06:06:02,970 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 28 treesize of output 30 [2022-07-20 06:06:03,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:06:03,048 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 43 treesize of output 30 [2022-07-20 06:06:03,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:06:03,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:06:03,198 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:03,198 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 57 [2022-07-20 06:06:03,204 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 20 treesize of output 22 [2022-07-20 06:06:03,373 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:03,373 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 57 treesize of output 49 [2022-07-20 06:06:03,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:06:03,393 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-20 06:06:03,441 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:03,441 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 57 treesize of output 49 [2022-07-20 06:06:03,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:06:03,469 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-20 06:06:03,492 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:03,492 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 64 treesize of output 57 [2022-07-20 06:06:03,497 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 20 treesize of output 22 [2022-07-20 06:06:03,722 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-20 06:06:03,728 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:03,729 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 45 treesize of output 21 [2022-07-20 06:06:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:06:03,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:06:04,005 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1427) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-20 06:06:04,079 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1427) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2022-07-20 06:06:04,104 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1427) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2022-07-20 06:06:04,177 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1421) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1420) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1420))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1421) .cse1 v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1427) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) is different from false [2022-07-20 06:06:04,227 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1421) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1420) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1426)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1420))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse4 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1421) .cse3 v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_1427) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)))))))) is different from false [2022-07-20 06:06:04,372 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1417 (_ BitVec 32)) (v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1420))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1417)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1421) .cse0 v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1427) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1417 (_ BitVec 32)) (v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1417)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1421) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1420) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))) is different from false [2022-07-20 06:06:04,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_18| (_ BitVec 32)) (v_ArrVal_1415 (_ BitVec 32))) (or (and (forall ((v_ArrVal_1420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1417 (_ BitVec 32)) (v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1417)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1421) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1420) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1417 (_ BitVec 32)) (v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1420))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1417)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1421) .cse1 v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1415) (select (select (store .cse3 .cse1 v_ArrVal_1427) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|) (_ bv0 1))))) is different from false [2022-07-20 06:06:04,552 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_18| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1415 (_ BitVec 32)) (v_ArrVal_1420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1417 (_ BitVec 32)) (v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1420))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1417)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1421) .cse0 v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1415) (select (select (store .cse2 .cse0 v_ArrVal_1427) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1417 (_ BitVec 32)) (v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1417)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1421) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1420) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|) (_ bv0 1))))) is different from false [2022-07-20 06:06:04,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_18| (_ BitVec 32)) (v_ArrVal_1413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (forall ((v_ArrVal_1415 (_ BitVec 32)) (v_ArrVal_1420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1417 (_ BitVec 32)) (v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1413))) (store .cse4 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1420))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse2 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1414))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1417))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1421) .cse1 v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1415) (select (select (store .cse3 .cse1 v_ArrVal_1427) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1417 (_ BitVec 32)) (v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1414))) (store .cse6 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1417))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1421) (select (select (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1413))) (store .cse7 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1420) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1426) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (bvule .cse5 (bvadd (_ bv4 32) .cse5))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|) (_ bv0 1))))) is different from false [2022-07-20 06:06:05,117 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:05,117 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 179 treesize of output 150 [2022-07-20 06:06:05,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:05,128 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 260 treesize of output 242 [2022-07-20 06:06:05,138 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:05,139 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 238 treesize of output 168 [2022-07-20 06:06:05,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:05,143 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 136 treesize of output 130 [2022-07-20 06:06:05,147 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 126 treesize of output 110 [2022-07-20 06:06:05,156 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 58 treesize of output 50 [2022-07-20 06:06:05,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:05,195 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 1 case distinctions, treesize of input 184 treesize of output 175 [2022-07-20 06:06:05,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:05,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:05,201 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 306 treesize of output 294 [2022-07-20 06:06:05,212 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:05,212 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 1 case distinctions, treesize of input 290 treesize of output 180 [2022-07-20 06:06:05,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:05,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:05,218 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 56 treesize of output 38 [2022-07-20 06:06:05,224 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 18 treesize of output 14 [2022-07-20 06:06:05,423 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:05,423 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 179 treesize of output 150 [2022-07-20 06:06:05,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:05,430 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 260 treesize of output 242 [2022-07-20 06:06:05,445 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:05,446 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 187 treesize of output 137 [2022-07-20 06:06:05,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:05,453 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 114 treesize of output 108 [2022-07-20 06:06:05,457 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 104 treesize of output 88 [2022-07-20 06:06:05,465 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 58 treesize of output 50 [2022-07-20 06:06:05,504 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 06:06:05,504 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 1 case distinctions, treesize of input 187 treesize of output 1 [2022-07-20 06:06:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 06:06:10,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:06:10,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931367122] [2022-07-20 06:06:10,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931367122] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:06:10,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:06:10,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2022-07-20 06:06:10,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804220404] [2022-07-20 06:06:10,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:06:10,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 06:06:10,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:06:10,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 06:06:10,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=350, Unknown=12, NotChecked=414, Total=870 [2022-07-20 06:06:10,992 INFO L87 Difference]: Start difference. First operand 300 states and 355 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:15,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:06:15,385 INFO L93 Difference]: Finished difference Result 512 states and 602 transitions. [2022-07-20 06:06:15,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 06:06:15,386 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 06:06:15,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:06:15,387 INFO L225 Difference]: With dead ends: 512 [2022-07-20 06:06:15,387 INFO L226 Difference]: Without dead ends: 512 [2022-07-20 06:06:15,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=270, Invalid=1086, Unknown=12, NotChecked=702, Total=2070 [2022-07-20 06:06:15,388 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 350 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1902 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:06:15,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 920 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 928 Invalid, 0 Unknown, 1902 Unchecked, 2.3s Time] [2022-07-20 06:06:15,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-07-20 06:06:15,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 314. [2022-07-20 06:06:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 293 states have (on average 1.2696245733788396) internal successors, (372), 313 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 372 transitions. [2022-07-20 06:06:15,392 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 372 transitions. Word has length 38 [2022-07-20 06:06:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:06:15,392 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 372 transitions. [2022-07-20 06:06:15,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 372 transitions. [2022-07-20 06:06:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:06:15,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:06:15,393 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:06:15,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-20 06:06:15,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:06:15,605 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:06:15,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:06:15,609 INFO L85 PathProgramCache]: Analyzing trace with hash -376181734, now seen corresponding path program 1 times [2022-07-20 06:06:15,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:06:15,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558106248] [2022-07-20 06:06:15,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:06:15,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:06:15,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:06:15,616 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:06:15,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-20 06:06:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:06:15,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 06:06:15,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:06:15,895 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-20 06:06:15,932 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:06:15,933 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 24 [2022-07-20 06:06:15,948 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 13 treesize of output 9 [2022-07-20 06:06:15,999 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:15,999 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 37 treesize of output 38 [2022-07-20 06:06:16,081 INFO L356 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2022-07-20 06:06:16,081 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 34 treesize of output 57 [2022-07-20 06:06:16,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:06:16,146 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 46 treesize of output 33 [2022-07-20 06:06:16,333 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:16,333 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 52 [2022-07-20 06:06:16,546 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:16,546 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 60 treesize of output 52 [2022-07-20 06:06:16,626 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:16,627 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 60 treesize of output 52 [2022-07-20 06:06:16,658 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:16,659 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 57 treesize of output 52 [2022-07-20 06:06:16,918 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 48 treesize of output 24 [2022-07-20 06:06:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:06:16,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:06:17,035 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1505) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (_ bv1 1))) is different from false [2022-07-20 06:06:17,050 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1505) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (_ bv1 1))) is different from false [2022-07-20 06:06:17,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1505) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (_ bv1 1))) is different from false [2022-07-20 06:06:17,069 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1502))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1505)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-20 06:06:17,079 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1502))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1505)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (_ bv1 1))) is different from false [2022-07-20 06:06:17,114 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1502))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1505)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (_ bv1 1))) is different from false [2022-07-20 06:06:17,130 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| (_ BitVec 32)) (v_ArrVal_1505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1499) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1502))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1505)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|) (_ bv0 1))))) is different from false [2022-07-20 06:06:17,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1499 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| (_ BitVec 32)) (v_ArrVal_1505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1499) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1502))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1505)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|) (_ bv0 1))))) is different from false [2022-07-20 06:06:17,171 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1499 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| (_ BitVec 32)) (v_ArrVal_1505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|) (_ bv0 1))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1499) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1498))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1502))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1505)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2022-07-20 06:06:17,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1499 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| (_ BitVec 32)) (v_ArrVal_1505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|) (_ bv0 1))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1499) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) v_ArrVal_1498))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1502))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1505)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (_ bv1 1)))) is different from false [2022-07-20 06:06:17,212 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:17,212 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 95 treesize of output 66 [2022-07-20 06:06:17,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:17,216 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 90 treesize of output 78 [2022-07-20 06:06:17,225 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 74 treesize of output 66 [2022-07-20 06:06:17,227 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 34 treesize of output 30 [2022-07-20 06:06:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 06:06:19,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:06:19,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558106248] [2022-07-20 06:06:19,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558106248] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:06:19,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:06:19,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2022-07-20 06:06:19,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347449596] [2022-07-20 06:06:19,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:06:19,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 06:06:19,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:06:19,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 06:06:19,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=298, Unknown=10, NotChecked=450, Total=870 [2022-07-20 06:06:19,916 INFO L87 Difference]: Start difference. First operand 314 states and 372 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:06:22,743 INFO L93 Difference]: Finished difference Result 350 states and 410 transitions. [2022-07-20 06:06:22,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 06:06:22,744 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 06:06:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:06:22,745 INFO L225 Difference]: With dead ends: 350 [2022-07-20 06:06:22,745 INFO L226 Difference]: Without dead ends: 350 [2022-07-20 06:06:22,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 10 IntricatePredicates, 3 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=191, Invalid=594, Unknown=11, NotChecked=610, Total=1406 [2022-07-20 06:06:22,745 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 66 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1405 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:06:22,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 994 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 1405 Unchecked, 0.2s Time] [2022-07-20 06:06:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-07-20 06:06:22,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 302. [2022-07-20 06:06:22,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 281 states have (on average 1.2669039145907472) internal successors, (356), 301 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 356 transitions. [2022-07-20 06:06:22,748 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 356 transitions. Word has length 38 [2022-07-20 06:06:22,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:06:22,748 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 356 transitions. [2022-07-20 06:06:22,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:22,748 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 356 transitions. [2022-07-20 06:06:22,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:06:22,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:06:22,749 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:06:22,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-07-20 06:06:22,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:06:22,949 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:06:22,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:06:22,950 INFO L85 PathProgramCache]: Analyzing trace with hash 267303164, now seen corresponding path program 1 times [2022-07-20 06:06:22,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:06:22,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727150901] [2022-07-20 06:06:22,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:06:22,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:06:22,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:06:22,951 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:06:22,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-20 06:06:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:06:23,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:06:23,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:06:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:06:23,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:06:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:06:23,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:06:23,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727150901] [2022-07-20 06:06:23,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727150901] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:06:23,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:06:23,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-20 06:06:23,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780221716] [2022-07-20 06:06:23,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:06:23,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:06:23,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:06:23,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:06:23,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:06:23,308 INFO L87 Difference]: Start difference. First operand 302 states and 356 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:23,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:06:23,500 INFO L93 Difference]: Finished difference Result 314 states and 367 transitions. [2022-07-20 06:06:23,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:06:23,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 06:06:23,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:06:23,502 INFO L225 Difference]: With dead ends: 314 [2022-07-20 06:06:23,502 INFO L226 Difference]: Without dead ends: 286 [2022-07-20 06:06:23,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:06:23,502 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 6 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:06:23,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 111 Unchecked, 0.2s Time] [2022-07-20 06:06:23,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-20 06:06:23,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-07-20 06:06:23,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 265 states have (on average 1.2792452830188679) internal successors, (339), 285 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 339 transitions. [2022-07-20 06:06:23,506 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 339 transitions. Word has length 38 [2022-07-20 06:06:23,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:06:23,506 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 339 transitions. [2022-07-20 06:06:23,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 339 transitions. [2022-07-20 06:06:23,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:06:23,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:06:23,506 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:06:23,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-20 06:06:23,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:06:23,707 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:06:23,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:06:23,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1093355750, now seen corresponding path program 1 times [2022-07-20 06:06:23,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:06:23,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426380121] [2022-07-20 06:06:23,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:06:23,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:06:23,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:06:23,709 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:06:23,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-20 06:06:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:06:23,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-20 06:06:23,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:06:23,968 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-20 06:06:23,989 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-20 06:06:24,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:06:24,003 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 23 treesize of output 22 [2022-07-20 06:06:24,039 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:06:24,040 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-20 06:06:24,070 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-20 06:06:24,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:06:24,081 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 21 treesize of output 20 [2022-07-20 06:06:24,156 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:24,156 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 29 treesize of output 30 [2022-07-20 06:06:24,159 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 20 treesize of output 22 [2022-07-20 06:06:24,180 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 16 treesize of output 8 [2022-07-20 06:06:24,226 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-20 06:06:24,244 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-20 06:06:24,257 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:06:24,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:06:24,283 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-20 06:06:24,288 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:06:24,336 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 20 treesize of output 8 [2022-07-20 06:06:24,363 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-20 06:06:24,407 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-20 06:06:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:06:24,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:06:24,518 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32)))) is different from false [2022-07-20 06:06:24,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))))) is different from false [2022-07-20 06:06:24,534 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1615) |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32)))) is different from false [2022-07-20 06:06:24,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_13| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc11#1.base_13|))) (forall ((v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1615) |v_ULTIMATE.start_main_#t~malloc11#1.base_13| v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32)))))) is different from false [2022-07-20 06:06:24,554 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc11#1.base_13| (_ BitVec 32)) (v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1615) |v_ULTIMATE.start_main_#t~malloc11#1.base_13| v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc11#1.base_13|))))) is different from false [2022-07-20 06:06:24,574 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc11#1.base_13| (_ BitVec 32)) (v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc11#1.base_13|))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1615) |v_ULTIMATE.start_main_#t~malloc11#1.base_13| v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))))))) is different from false [2022-07-20 06:06:24,588 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:06:24,588 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 12 [2022-07-20 06:06:24,597 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc11#1.base_13| (_ BitVec 32)) (v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1615) |v_ULTIMATE.start_main_#t~malloc11#1.base_13| v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))))) (= |v_ULTIMATE.start_main_#t~malloc11#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-07-20 06:06:24,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc11#1.base_13| (_ BitVec 32)) (v_ArrVal_1611 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1612 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1611) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1612) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1615) |v_ULTIMATE.start_main_#t~malloc11#1.base_13| v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32))) (= |v_ULTIMATE.start_main_#t~malloc11#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-07-20 06:06:24,628 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc11#1.base_13| (_ BitVec 32)) (v_ArrVal_1611 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1612 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc11#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1611) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1612) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1615)) |v_ULTIMATE.start_main_#t~malloc11#1.base_13| v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32))))) is different from false [2022-07-20 06:06:24,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:24,645 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 1 case distinctions, treesize of input 42 treesize of output 43 [2022-07-20 06:06:24,647 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 79 treesize of output 71 [2022-07-20 06:06:24,650 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 63 treesize of output 61 [2022-07-20 06:06:24,702 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_223 (_ BitVec 32)) (v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc11#1.base_13| (_ BitVec 32)) (v_ArrVal_1611 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1607 (_ BitVec 32)) (v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1607))) (.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (.cse2 (= |c_ULTIMATE.start_main_#t~malloc7#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (or (not (= (_ bv2 32) (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1615) |v_ULTIMATE.start_main_#t~malloc11#1.base_13| v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) .cse2) (or (not (= (_ bv2 32) (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1611) v_arrayElimCell_223 v_ArrVal_1615) |v_ULTIMATE.start_main_#t~malloc11#1.base_13| v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (not .cse2)))) (= |v_ULTIMATE.start_main_#t~malloc11#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-07-20 06:06:24,793 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_13| (_ BitVec 32))) (or (and (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) (_ bv0 1))) (forall ((v_arrayElimCell_223 (_ BitVec 32)) (v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1611 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1611) v_arrayElimCell_223 v_ArrVal_1615) |v_ULTIMATE.start_main_#t~malloc11#1.base_13| v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_25| (_ BitVec 32))) (or (forall ((v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1607 (_ BitVec 32)) (v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1607)) |v_ULTIMATE.start_main_#t~malloc7#1.base_25| v_ArrVal_1615) |v_ULTIMATE.start_main_#t~malloc11#1.base_13| v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_25| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_25|)))))) (= |v_ULTIMATE.start_main_#t~malloc11#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-07-20 06:06:24,843 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_13| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc11#1.base_13|) (and (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_25| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_25|) (forall ((v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1607 (_ BitVec 32)) (v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1607)) |v_ULTIMATE.start_main_#t~malloc7#1.base_25| v_ArrVal_1615) |v_ULTIMATE.start_main_#t~malloc11#1.base_13| v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_25|))))) (or (forall ((v_arrayElimCell_223 (_ BitVec 32)) (v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1611 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1611) v_arrayElimCell_223 v_ArrVal_1615) |v_ULTIMATE.start_main_#t~malloc11#1.base_13| v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32)))) (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|))))))) is different from false [2022-07-20 06:06:24,903 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_13| (_ BitVec 32)) (v_ArrVal_1604 (_ BitVec 32))) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_25| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_25|) (forall ((v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1607 (_ BitVec 32)) (v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)) v_ArrVal_1604) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1607)) |v_ULTIMATE.start_main_#t~malloc7#1.base_25| v_ArrVal_1615) |v_ULTIMATE.start_main_#t~malloc11#1.base_13| v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_25|))))) (or (forall ((v_arrayElimCell_223 (_ BitVec 32)) (v_ArrVal_1618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1611 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1615 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1611) v_arrayElimCell_223 v_ArrVal_1615) |v_ULTIMATE.start_main_#t~malloc11#1.base_13| v_ArrVal_1618) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32)))) (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|))))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc11#1.base_13|))) is different from false [2022-07-20 06:06:24,947 INFO L356 Elim1Store]: treesize reduction 106, result has 0.9 percent of original size [2022-07-20 06:06:24,947 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 3 case distinctions, treesize of input 34 treesize of output 1 [2022-07-20 06:06:24,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:24,953 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 8 treesize of output 4 [2022-07-20 06:06:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 06:06:24,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:06:24,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426380121] [2022-07-20 06:06:24,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426380121] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:06:24,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:06:24,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 34 [2022-07-20 06:06:24,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333974997] [2022-07-20 06:06:24,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:06:24,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 06:06:24,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:06:24,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 06:06:24,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=350, Unknown=13, NotChecked=650, Total=1122 [2022-07-20 06:06:24,987 INFO L87 Difference]: Start difference. First operand 286 states and 339 transitions. Second operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:06:27,356 INFO L93 Difference]: Finished difference Result 614 states and 717 transitions. [2022-07-20 06:06:27,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-20 06:06:27,357 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 06:06:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:06:27,358 INFO L225 Difference]: With dead ends: 614 [2022-07-20 06:06:27,358 INFO L226 Difference]: Without dead ends: 614 [2022-07-20 06:06:27,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 41 SyntacticMatches, 10 SemanticMatches, 52 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=349, Invalid=1330, Unknown=13, NotChecked=1170, Total=2862 [2022-07-20 06:06:27,359 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 413 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 4097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2683 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-20 06:06:27,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1340 Invalid, 4097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1326 Invalid, 0 Unknown, 2683 Unchecked, 1.7s Time] [2022-07-20 06:06:27,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-07-20 06:06:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 310. [2022-07-20 06:06:27,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 289 states have (on average 1.2629757785467128) internal successors, (365), 309 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 365 transitions. [2022-07-20 06:06:27,363 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 365 transitions. Word has length 38 [2022-07-20 06:06:27,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:06:27,363 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 365 transitions. [2022-07-20 06:06:27,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 365 transitions. [2022-07-20 06:06:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:06:27,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:06:27,363 INFO L195 NwaCegarLoop]: trace histogram [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-20 06:06:27,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2022-07-20 06:06:27,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:06:27,572 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:06:27,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:06:27,572 INFO L85 PathProgramCache]: Analyzing trace with hash -414280174, now seen corresponding path program 1 times [2022-07-20 06:06:27,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:06:27,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379843358] [2022-07-20 06:06:27,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:06:27,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:06:27,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:06:27,574 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:06:27,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-20 06:06:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:06:27,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-20 06:06:27,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:06:27,811 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-20 06:06:27,832 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-20 06:06:27,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:06:27,847 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 23 treesize of output 22 [2022-07-20 06:06:27,885 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:06:27,885 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-20 06:06:27,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:06:27,913 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 21 treesize of output 20 [2022-07-20 06:06:27,918 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-20 06:06:27,992 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:27,992 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 29 treesize of output 30 [2022-07-20 06:06:27,995 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 20 treesize of output 22 [2022-07-20 06:06:28,019 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 16 treesize of output 8 [2022-07-20 06:06:28,069 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-20 06:06:28,085 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-20 06:06:28,100 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:06:28,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:06:28,126 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-20 06:06:28,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:06:28,173 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 20 treesize of output 8 [2022-07-20 06:06:28,207 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-20 06:06:28,258 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-20 06:06:28,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:06:28,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:06:28,374 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1702 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))))) is different from false [2022-07-20 06:06:28,380 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1702 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1702) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))))) is different from false [2022-07-20 06:06:28,390 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1700 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1700) |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32)))) is different from false [2022-07-20 06:06:28,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_16| (_ BitVec 32))) (or (forall ((v_ArrVal_1702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1700 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1700) |v_ULTIMATE.start_main_#t~malloc11#1.base_16| v_ArrVal_1702) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc11#1.base_16|) (_ bv0 1))))) is different from false [2022-07-20 06:06:28,410 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_16| (_ BitVec 32)) (v_ArrVal_1702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1700 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1700) |v_ULTIMATE.start_main_#t~malloc11#1.base_16| v_ArrVal_1702) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc11#1.base_16|) (_ bv0 1))))) is different from false [2022-07-20 06:06:28,439 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_16| (_ BitVec 32)) (v_ArrVal_1702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1700 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1700) |v_ULTIMATE.start_main_#t~malloc11#1.base_16| v_ArrVal_1702) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc11#1.base_16|) (_ bv0 1))))) is different from false [2022-07-20 06:06:28,453 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:06:28,453 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 12 [2022-07-20 06:06:28,461 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_16| (_ BitVec 32)) (v_ArrVal_1702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1700 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc11#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1700) |v_ULTIMATE.start_main_#t~malloc11#1.base_16| v_ArrVal_1702) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))))))) is different from false [2022-07-20 06:06:28,479 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_16| (_ BitVec 32)) (v_ArrVal_1695 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1700 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1695) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1700) |v_ULTIMATE.start_main_#t~malloc11#1.base_16| v_ArrVal_1702) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32))) (= |v_ULTIMATE.start_main_#t~malloc11#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-07-20 06:06:28,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_16| (_ BitVec 32)) (v_ArrVal_1695 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1700 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc11#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1695) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1696) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1700)) |v_ULTIMATE.start_main_#t~malloc11#1.base_16| v_ArrVal_1702) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32))))) is different from false [2022-07-20 06:06:28,517 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:28,517 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 1 case distinctions, treesize of input 42 treesize of output 43 [2022-07-20 06:06:28,520 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 79 treesize of output 71 [2022-07-20 06:06:28,522 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 63 treesize of output 61 [2022-07-20 06:06:28,595 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_16| (_ BitVec 32)) (v_ArrVal_1695 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1693 (_ BitVec 32)) (v_ArrVal_1702 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_243 (_ BitVec 32)) (v_ArrVal_1700 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1693))) (.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (.cse2 (= |c_ULTIMATE.start_main_#t~malloc7#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (or (not (= (_ bv2 32) (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1695) v_arrayElimCell_243 v_ArrVal_1700) |v_ULTIMATE.start_main_#t~malloc11#1.base_16| v_ArrVal_1702) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (not .cse2)) (or (not (= (_ bv2 32) (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1700) |v_ULTIMATE.start_main_#t~malloc11#1.base_16| v_ArrVal_1702) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) .cse2))) (= |v_ULTIMATE.start_main_#t~malloc11#1.base_16| |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-07-20 06:06:29,085 INFO L356 Elim1Store]: treesize reduction 106, result has 0.9 percent of original size [2022-07-20 06:06:29,086 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 3 case distinctions, treesize of input 34 treesize of output 1 [2022-07-20 06:06:29,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:29,090 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 8 treesize of output 4 [2022-07-20 06:06:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:06:29,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:06:29,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379843358] [2022-07-20 06:06:29,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379843358] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:06:29,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:06:29,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 34 [2022-07-20 06:06:29,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289079051] [2022-07-20 06:06:29,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:06:29,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 06:06:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:06:29,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 06:06:29,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=442, Unknown=32, NotChecked=530, Total=1122 [2022-07-20 06:06:29,150 INFO L87 Difference]: Start difference. First operand 310 states and 365 transitions. Second operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:06:31,677 INFO L93 Difference]: Finished difference Result 564 states and 642 transitions. [2022-07-20 06:06:31,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-20 06:06:31,678 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 06:06:31,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:06:31,679 INFO L225 Difference]: With dead ends: 564 [2022-07-20 06:06:31,679 INFO L226 Difference]: Without dead ends: 564 [2022-07-20 06:06:31,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 41 SyntacticMatches, 10 SemanticMatches, 54 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=420, Invalid=1649, Unknown=41, NotChecked=970, Total=3080 [2022-07-20 06:06:31,680 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 430 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 3732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2485 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:06:31,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1616 Invalid, 3732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1193 Invalid, 0 Unknown, 2485 Unchecked, 1.5s Time] [2022-07-20 06:06:31,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-07-20 06:06:31,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 299. [2022-07-20 06:06:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 278 states have (on average 1.2697841726618706) internal successors, (353), 298 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 353 transitions. [2022-07-20 06:06:31,688 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 353 transitions. Word has length 38 [2022-07-20 06:06:31,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:06:31,688 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 353 transitions. [2022-07-20 06:06:31,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:31,688 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 353 transitions. [2022-07-20 06:06:31,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:06:31,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:06:31,689 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-20 06:06:31,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2022-07-20 06:06:31,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:06:31,898 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:06:31,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:06:31,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1382957961, now seen corresponding path program 1 times [2022-07-20 06:06:31,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:06:31,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385822784] [2022-07-20 06:06:31,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:06:31,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:06:31,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:06:31,900 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:06:31,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-07-20 06:06:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:06:32,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 06:06:32,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:06:32,239 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-20 06:06:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:06:32,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:06:32,367 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:32,367 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 20 treesize of output 23 [2022-07-20 06:06:32,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:06:32,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:06:32,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385822784] [2022-07-20 06:06:32,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385822784] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:06:32,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:06:32,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-07-20 06:06:32,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761486460] [2022-07-20 06:06:32,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:06:32,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 06:06:32,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:06:32,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 06:06:32,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:06:32,414 INFO L87 Difference]: Start difference. First operand 299 states and 353 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:33,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:06:33,625 INFO L93 Difference]: Finished difference Result 390 states and 448 transitions. [2022-07-20 06:06:33,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 06:06:33,626 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-20 06:06:33,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:06:33,627 INFO L225 Difference]: With dead ends: 390 [2022-07-20 06:06:33,627 INFO L226 Difference]: Without dead ends: 390 [2022-07-20 06:06:33,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:06:33,627 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 409 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:06:33,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 631 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 06:06:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-07-20 06:06:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 349. [2022-07-20 06:06:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 328 states have (on average 1.2774390243902438) internal successors, (419), 348 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 419 transitions. [2022-07-20 06:06:33,631 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 419 transitions. Word has length 40 [2022-07-20 06:06:33,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:06:33,631 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 419 transitions. [2022-07-20 06:06:33,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 419 transitions. [2022-07-20 06:06:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:06:33,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:06:33,631 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-20 06:06:33,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-07-20 06:06:33,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:06:33,832 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:06:33,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:06:33,832 INFO L85 PathProgramCache]: Analyzing trace with hash 730040579, now seen corresponding path program 1 times [2022-07-20 06:06:33,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:06:33,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585912164] [2022-07-20 06:06:33,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:06:33,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:06:33,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:06:33,834 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:06:33,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-07-20 06:06:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:06:34,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-20 06:06:34,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:06:34,070 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-20 06:06:34,082 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-20 06:06:34,103 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:06:34,103 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-20 06:06:34,120 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 13 treesize of output 9 [2022-07-20 06:06:34,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:06:34,125 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 23 treesize of output 22 [2022-07-20 06:06:34,156 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 20 treesize of output 8 [2022-07-20 06:06:34,175 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-20 06:06:34,220 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:06:34,220 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-20 06:06:34,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:06:34,242 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 21 treesize of output 20 [2022-07-20 06:06:34,251 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-20 06:06:34,327 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:34,327 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 29 treesize of output 30 [2022-07-20 06:06:34,330 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 20 treesize of output 22 [2022-07-20 06:06:34,348 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 16 treesize of output 8 [2022-07-20 06:06:34,392 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-20 06:06:34,408 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-20 06:06:34,415 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-20 06:06:34,454 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-20 06:06:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:06:34,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:06:34,546 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1819) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32))) is different from false [2022-07-20 06:06:34,567 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1819) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))))) is different from false [2022-07-20 06:06:34,573 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1819) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32))) is different from false [2022-07-20 06:06:34,583 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1815) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1816) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1819) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))) (_ bv2 32))) is different from false [2022-07-20 06:06:34,592 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1819 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1815) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1816) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1819)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32))))) is different from false [2022-07-20 06:06:34,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:34,603 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 38 treesize of output 39 [2022-07-20 06:06:34,605 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 70 treesize of output 62 [2022-07-20 06:06:34,609 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 29 treesize of output 27 [2022-07-20 06:06:34,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1812 (_ BitVec 32)) (v_ArrVal_1819 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_264 (_ BitVec 32))) (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc7#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1812))) (.cse2 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))) (or (and (not .cse0) (= (_ bv2 32) (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1819) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (and .cse0 (= (_ bv2 32) (select (select (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1815) v_arrayElimCell_264 v_ArrVal_1819) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) is different from false [2022-07-20 06:06:35,907 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:06:35,907 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 12 [2022-07-20 06:06:35,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1812 (_ BitVec 32)) (v_ArrVal_1819 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_32| (_ BitVec 32)) (v_ArrVal_1807 (_ BitVec 32)) (v_ArrVal_1810 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv2 32) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)) v_ArrVal_1807)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1810))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1812))) |v_ULTIMATE.start_main_#t~malloc7#1.base_32| v_ArrVal_1819) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv12 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_32|))) is different from false [2022-07-20 06:06:36,111 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-20 06:06:36,111 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 56 treesize of output 47 [2022-07-20 06:06:36,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:36,116 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 36 treesize of output 24 [2022-07-20 06:06:36,119 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 7 treesize of output 3 [2022-07-20 06:06:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:06:36,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:06:36,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585912164] [2022-07-20 06:06:36,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585912164] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:06:36,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:06:36,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 32 [2022-07-20 06:06:36,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429368918] [2022-07-20 06:06:36,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:06:36,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-20 06:06:36,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:06:36,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-20 06:06:36,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=480, Unknown=31, NotChecked=364, Total=992 [2022-07-20 06:06:36,166 INFO L87 Difference]: Start difference. First operand 349 states and 419 transitions. Second operand has 32 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:06:38,230 INFO L93 Difference]: Finished difference Result 525 states and 623 transitions. [2022-07-20 06:06:38,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 06:06:38,231 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-20 06:06:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:06:38,232 INFO L225 Difference]: With dead ends: 525 [2022-07-20 06:06:38,232 INFO L226 Difference]: Without dead ends: 525 [2022-07-20 06:06:38,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=350, Invalid=1368, Unknown=32, NotChecked=602, Total=2352 [2022-07-20 06:06:38,233 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 545 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1620 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:06:38,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1003 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 909 Invalid, 0 Unknown, 1620 Unchecked, 1.4s Time] [2022-07-20 06:06:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-07-20 06:06:38,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 349. [2022-07-20 06:06:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 328 states have (on average 1.274390243902439) internal successors, (418), 348 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 418 transitions. [2022-07-20 06:06:38,236 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 418 transitions. Word has length 40 [2022-07-20 06:06:38,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:06:38,236 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 418 transitions. [2022-07-20 06:06:38,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 418 transitions. [2022-07-20 06:06:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:06:38,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:06:38,237 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-20 06:06:38,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-07-20 06:06:38,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:06:38,446 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:06:38,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:06:38,447 INFO L85 PathProgramCache]: Analyzing trace with hash 343328011, now seen corresponding path program 1 times [2022-07-20 06:06:38,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:06:38,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062369626] [2022-07-20 06:06:38,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:06:38,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:06:38,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:06:38,448 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:06:38,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-07-20 06:06:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:06:38,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-20 06:06:38,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:06:38,704 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-20 06:06:38,728 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-20 06:06:38,732 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-20 06:06:38,788 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:06:38,789 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-20 06:06:38,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:06:38,820 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 21 treesize of output 20 [2022-07-20 06:06:38,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:06:38,829 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 21 treesize of output 20 [2022-07-20 06:06:38,922 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:38,922 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:06:38,927 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 20 treesize of output 22 [2022-07-20 06:06:39,065 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:06:39,065 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 16 treesize of output 22 [2022-07-20 06:06:39,070 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 7 treesize of output 3 [2022-07-20 06:06:39,087 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:39,088 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 29 [2022-07-20 06:06:39,127 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:39,128 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 29 [2022-07-20 06:06:39,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:06:39,138 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-20 06:06:39,148 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:06:39,149 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-20 06:06:39,193 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:06:39,193 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 16 treesize of output 22 [2022-07-20 06:06:39,196 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 7 treesize of output 3 [2022-07-20 06:06:39,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:06:39,248 INFO L356 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-07-20 06:06:39,248 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 2 case distinctions, treesize of input 38 treesize of output 36 [2022-07-20 06:06:39,399 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 06:06:39,400 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 63 [2022-07-20 06:06:39,421 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 20 treesize of output 22 [2022-07-20 06:06:39,431 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 20 treesize of output 12 [2022-07-20 06:06:39,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:39,594 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:39,594 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 17 treesize of output 10 [2022-07-20 06:06:39,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:39,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:06:39,602 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:39,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 14 [2022-07-20 06:06:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:06:39,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:06:39,818 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1905 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1904) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-20 06:06:39,830 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1904) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (forall ((v_ArrVal_1905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1905) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-20 06:06:39,849 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1904 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)) |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1904) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (forall ((v_ArrVal_1905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-20 06:06:39,878 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_21| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1903) |v_ULTIMATE.start_main_#t~malloc11#1.base_21| v_ArrVal_1905) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (forall ((v_ArrVal_1904 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc11#1.base_21|)) |v_ULTIMATE.start_main_#t~malloc11#1.base_21| v_ArrVal_1904) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) |c_ULTIMATE.start_main_~head~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc11#1.base_21|))))) is different from false [2022-07-20 06:06:39,891 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:39,891 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 06:06:39,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1899 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc11#1.base_21| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc11#1.base_21|))) (and (forall ((v_ArrVal_1905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1903) |v_ULTIMATE.start_main_#t~malloc11#1.base_21| v_ArrVal_1905) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (forall ((v_ArrVal_1904 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_1899 (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc11#1.base_21|)) |v_ULTIMATE.start_main_#t~malloc11#1.base_21| v_ArrVal_1904) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))))) is different from false [2022-07-20 06:06:39,930 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:39,930 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 06:06:39,961 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:39,961 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 06:06:39,978 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:39,979 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 06:06:39,994 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_21| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc11#1.base_21|))) (and (forall ((v_ArrVal_1904 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_26) |v_ULTIMATE.start_main_#t~malloc11#1.base_21| v_ArrVal_1904) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (not (= |v_ULTIMATE.start_main_#t~malloc11#1.base_21| (select v_arrayElimArr_26 (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_1905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1903) |v_ULTIMATE.start_main_#t~malloc11#1.base_21| v_ArrVal_1905) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))))) is different from false [2022-07-20 06:06:40,031 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_21| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc11#1.base_21|))) (and (forall ((v_ArrVal_1904 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_arrayElimArr_26) |v_ULTIMATE.start_main_#t~malloc11#1.base_21| v_ArrVal_1904) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (not (= |v_ULTIMATE.start_main_#t~malloc11#1.base_21| (select v_arrayElimArr_26 (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_1905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1903) |v_ULTIMATE.start_main_#t~malloc11#1.base_21| v_ArrVal_1905) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))))) is different from false [2022-07-20 06:06:40,043 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:06:40,043 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 12 [2022-07-20 06:06:40,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_21| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc11#1.base_21| |c_ULTIMATE.start_main_~x~0#1.base|) (and (forall ((v_ArrVal_1904 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_arrayElimArr_26) |v_ULTIMATE.start_main_#t~malloc11#1.base_21| v_ArrVal_1904) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (not (= (select v_arrayElimArr_26 (bvadd (_ bv8 32) v_subst_1)) |v_ULTIMATE.start_main_#t~malloc11#1.base_21|)))) (forall ((v_ArrVal_1905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1903) |v_ULTIMATE.start_main_#t~malloc11#1.base_21| v_ArrVal_1905) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))))) is different from false [2022-07-20 06:06:40,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1896 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1895 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc11#1.base_21| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc11#1.base_21| |c_ULTIMATE.start_main_~x~0#1.base|) (and (forall ((v_ArrVal_1904 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1895))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_arrayElimArr_26)) |v_ULTIMATE.start_main_#t~malloc11#1.base_21| v_ArrVal_1904) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (not (= (select v_arrayElimArr_26 (bvadd (_ bv8 32) v_subst_1)) |v_ULTIMATE.start_main_#t~malloc11#1.base_21|)))) (forall ((v_ArrVal_1905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1896) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1895) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1903) |v_ULTIMATE.start_main_#t~malloc11#1.base_21| v_ArrVal_1905) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))))) is different from false [2022-07-20 06:06:40,194 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_21| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1896 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1895 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1896) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1895) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1903)) |v_ULTIMATE.start_main_#t~malloc11#1.base_21| v_ArrVal_1905) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (forall ((v_ArrVal_1904 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1895 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1895))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_arrayElimArr_26)) |v_ULTIMATE.start_main_#t~malloc11#1.base_21| v_ArrVal_1904) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) |c_ULTIMATE.start_main_~head~0#1.base|) (not (= (select v_arrayElimArr_26 (bvadd (_ bv8 32) v_subst_1)) |v_ULTIMATE.start_main_#t~malloc11#1.base_21|))))) (= |v_ULTIMATE.start_main_#t~malloc11#1.base_21| |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-07-20 06:06:40,374 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1892 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc11#1.base_21| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc11#1.base_21| |c_ULTIMATE.start_main_~x~0#1.base|) (and (forall ((v_ArrVal_1904 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1895 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1895))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_arrayElimArr_26)) |v_ULTIMATE.start_main_#t~malloc11#1.base_21| v_ArrVal_1904) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) |c_ULTIMATE.start_main_~head~0#1.base|) (not (= (select v_arrayElimArr_26 (bvadd (_ bv8 32) v_subst_1)) |v_ULTIMATE.start_main_#t~malloc11#1.base_21|)))) (forall ((v_ArrVal_1905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1896 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1895 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1892)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1896) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1895) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1903) |v_ULTIMATE.start_main_#t~malloc11#1.base_21| v_ArrVal_1905) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))))) is different from false [2022-07-20 06:06:41,591 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-20 06:06:41,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 57 [2022-07-20 06:06:41,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:41,609 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:41,609 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 38 treesize of output 44 [2022-07-20 06:06:41,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:41,617 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 56 [2022-07-20 06:06:41,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:06:41,623 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 188 treesize of output 164 [2022-07-20 06:06:41,630 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 114 treesize of output 98 [2022-07-20 06:06:41,637 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 53 treesize of output 45 [2022-07-20 06:06:41,641 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 90 treesize of output 78 [2022-07-20 06:06:41,672 INFO L356 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-07-20 06:06:41,672 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 51 treesize of output 1 [2022-07-20 06:06:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:06:41,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:06:41,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062369626] [2022-07-20 06:06:41,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062369626] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:06:41,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:06:41,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 34 [2022-07-20 06:06:41,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223313111] [2022-07-20 06:06:41,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:06:41,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 06:06:41,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:06:41,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 06:06:41,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=421, Unknown=20, NotChecked=572, Total=1122 [2022-07-20 06:06:41,774 INFO L87 Difference]: Start difference. First operand 349 states and 418 transitions. Second operand has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:45,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:06:45,120 INFO L93 Difference]: Finished difference Result 428 states and 501 transitions. [2022-07-20 06:06:45,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 06:06:45,120 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-20 06:06:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:06:45,122 INFO L225 Difference]: With dead ends: 428 [2022-07-20 06:06:45,122 INFO L226 Difference]: Without dead ends: 428 [2022-07-20 06:06:45,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 11 IntricatePredicates, 1 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=285, Invalid=1069, Unknown=22, NotChecked=880, Total=2256 [2022-07-20 06:06:45,123 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 237 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 3201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2243 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-20 06:06:45,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1249 Invalid, 3201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 878 Invalid, 0 Unknown, 2243 Unchecked, 1.7s Time] [2022-07-20 06:06:45,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-07-20 06:06:45,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 343. [2022-07-20 06:06:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 322 states have (on average 1.2763975155279503) internal successors, (411), 342 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 411 transitions. [2022-07-20 06:06:45,127 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 411 transitions. Word has length 40 [2022-07-20 06:06:45,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:06:45,127 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 411 transitions. [2022-07-20 06:06:45,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:06:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 411 transitions. [2022-07-20 06:06:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:06:45,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:06:45,128 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:06:45,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2022-07-20 06:06:45,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:06:45,337 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:06:45,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:06:45,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1071076886, now seen corresponding path program 1 times [2022-07-20 06:06:45,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:06:45,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591497790] [2022-07-20 06:06:45,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:06:45,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:06:45,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:06:45,339 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:06:45,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-07-20 06:06:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:06:45,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 06:06:45,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:06:45,571 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-20 06:06:45,629 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:06:45,629 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 24 [2022-07-20 06:06:45,689 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-20 06:06:45,777 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:45,777 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-20 06:06:45,860 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:45,860 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 29 [2022-07-20 06:06:45,900 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:45,901 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 29 [2022-07-20 06:06:45,918 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:06:45,918 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-20 06:06:46,018 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-20 06:06:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:06:46,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:06:46,191 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1971) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-20 06:06:46,209 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1971) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-20 06:06:46,268 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1968))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1971)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-20 06:06:46,281 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1968))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1971)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:06:46,293 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:46,294 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 38 treesize of output 31 [2022-07-20 06:06:46,305 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:46,306 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 252 treesize of output 227 [2022-07-20 06:06:46,312 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 212 treesize of output 204 [2022-07-20 06:06:46,326 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:06:46,327 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 204 treesize of output 196 [2022-07-20 06:07:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:03,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:07:03,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591497790] [2022-07-20 06:07:03,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591497790] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:03,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:07:03,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2022-07-20 06:07:03,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860572773] [2022-07-20 06:07:03,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:03,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-20 06:07:03,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:07:03,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-20 06:07:03,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=328, Unknown=7, NotChecked=164, Total=600 [2022-07-20 06:07:03,019 INFO L87 Difference]: Start difference. First operand 343 states and 411 transitions. Second operand has 25 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:04,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:04,434 INFO L93 Difference]: Finished difference Result 546 states and 656 transitions. [2022-07-20 06:07:04,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:07:04,435 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-20 06:07:04,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:04,436 INFO L225 Difference]: With dead ends: 546 [2022-07-20 06:07:04,436 INFO L226 Difference]: Without dead ends: 546 [2022-07-20 06:07:04,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=189, Invalid=522, Unknown=7, NotChecked=212, Total=930 [2022-07-20 06:07:04,437 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 395 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1201 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:04,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 852 Invalid, 2066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 783 Invalid, 0 Unknown, 1201 Unchecked, 1.1s Time] [2022-07-20 06:07:04,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-20 06:07:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 383. [2022-07-20 06:07:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 362 states have (on average 1.270718232044199) internal successors, (460), 382 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 460 transitions. [2022-07-20 06:07:04,440 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 460 transitions. Word has length 40 [2022-07-20 06:07:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:04,440 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 460 transitions. [2022-07-20 06:07:04,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 460 transitions. [2022-07-20 06:07:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:07:04,441 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:04,441 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-20 06:07:04,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Ended with exit code 0 [2022-07-20 06:07:04,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:07:04,641 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 06:07:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:04,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1071076887, now seen corresponding path program 1 times [2022-07-20 06:07:04,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:07:04,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312702204] [2022-07-20 06:07:04,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:04,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:07:04,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:07:04,643 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:07:04,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-07-20 06:07:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:04,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-20 06:07:04,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:04,861 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-20 06:07:04,889 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:07:04,889 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-20 06:07:04,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-20 06:07:04,915 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-20 06:07:04,919 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-20 06:07:04,994 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:04,995 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 38 treesize of output 37 [2022-07-20 06:07:04,998 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-20 06:07:05,079 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:07:05,079 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 14 treesize of output 20 [2022-07-20 06:07:05,084 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-20 06:07:05,106 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:05,106 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 29 [2022-07-20 06:07:05,157 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:07:05,157 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 14 treesize of output 20 [2022-07-20 06:07:05,162 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-20 06:07:05,175 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:05,175 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 29 [2022-07-20 06:07:05,203 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:05,203 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 38 treesize of output 37 [2022-07-20 06:07:05,206 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-20 06:07:05,317 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-20 06:07:05,320 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 15 treesize of output 7 [2022-07-20 06:07:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:05,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:05,679 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2042 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2042) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv12 32)) (bvadd (_ bv16 32) .cse0)))) (forall ((v_ArrVal_2042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2043 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv16 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2042) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2043) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-20 06:07:05,733 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2042 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2042) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv12 32)) (bvadd (_ bv16 32) .cse0)))) (forall ((v_ArrVal_2042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2043 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv16 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2042) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2043) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-20 06:07:05,756 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2043 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv16 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2042) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2043) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_2042 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2042) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse1))))) is different from false [2022-07-20 06:07:05,807 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2036 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2037 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2036))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2037) .cse0 v_ArrVal_2042) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv16 32)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_2043) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_2042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2036 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2037 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2037) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2036) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2042) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse2 (_ bv12 32)) (bvadd .cse2 (_ bv16 32)))))) is different from false [2022-07-20 06:07:05,846 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2036 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2037 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2036))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2037) .cse1 v_ArrVal_2042) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2043) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (forall ((v_ArrVal_2042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2036 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2037 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_2037) (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2036) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2042)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse3 (_ bv12 32)) (bvadd (_ bv16 32) .cse3))))) is different from false [2022-07-20 06:07:05,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:05,871 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 73 treesize of output 74 [2022-07-20 06:07:05,886 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:05,887 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 65 treesize of output 50 [2022-07-20 06:07:05,906 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:05,906 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 632 treesize of output 567 [2022-07-20 06:07:05,939 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:05,940 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 1872 treesize of output 1783 [2022-07-20 06:07:05,955 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 1768 treesize of output 1736 [2022-07-20 06:07:05,967 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 1736 treesize of output 1656 [2022-07-20 06:07:05,983 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 1656 treesize of output 1576 [2022-07-20 06:07:06,010 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:06,010 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 1576 treesize of output 1436