./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 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/sll-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 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:17:18,843 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:17:18,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:17:18,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:17:18,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:17:18,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:17:18,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:17:18,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:17:18,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:17:18,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:17:18,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:17:18,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:17:18,898 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:17:18,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:17:18,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:17:18,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:17:18,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:17:18,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:17:18,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:17:18,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:17:18,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:17:18,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:17:18,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:17:18,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:17:18,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:17:18,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:17:18,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:17:18,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:17:18,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:17:18,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:17:18,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:17:18,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:17:18,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:17:18,927 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:17:18,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:17:18,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:17:18,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:17:18,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:17:18,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:17:18,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:17:18,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:17:18,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:17:18,959 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:17:18,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:17:18,960 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:17:18,960 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:17:18,961 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:17:18,961 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:17:18,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:17:18,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:17:18,962 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:17:18,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:17:18,963 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:17:18,963 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:17:18,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:17:18,963 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:17:18,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:17:18,963 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:17:18,964 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:17:18,964 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:17:18,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:17:18,964 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:17:18,964 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:17:18,964 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:17:18,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:17:18,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:17:18,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:17:18,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:17:18,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:17:18,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:17:18,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:17:18,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:17:18,966 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:17:18,966 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:17:18,966 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:17:18,967 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:17:18,967 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 [2023-02-15 13:17:19,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:17:19,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:17:19,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:17:19,218 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:17:19,218 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:17:19,219 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-optional-1.i [2023-02-15 13:17:20,242 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:17:20,469 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:17:20,470 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i [2023-02-15 13:17:20,478 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/187b65644/52d4a0f757214d6183c3e47eac16670d/FLAG511c31787 [2023-02-15 13:17:20,490 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/187b65644/52d4a0f757214d6183c3e47eac16670d [2023-02-15 13:17:20,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:17:20,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:17:20,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:17:20,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:17:20,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:17:20,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:17:20" (1/1) ... [2023-02-15 13:17:20,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3becd40b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:17:20, skipping insertion in model container [2023-02-15 13:17:20,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:17:20" (1/1) ... [2023-02-15 13:17:20,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:17:20,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:17:20,769 WARN L237 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/sll-optional-1.i[22688,22701] [2023-02-15 13:17:20,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:17:20,792 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:17:20,823 WARN L237 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/sll-optional-1.i[22688,22701] [2023-02-15 13:17:20,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:17:20,841 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:17:20,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:17:20 WrapperNode [2023-02-15 13:17:20,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:17:20,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:17:20,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:17:20,842 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:17:20,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:17:20" (1/1) ... [2023-02-15 13:17:20,858 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:17:20" (1/1) ... [2023-02-15 13:17:20,887 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 136 [2023-02-15 13:17:20,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:17:20,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:17:20,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:17:20,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:17:20,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:17:20" (1/1) ... [2023-02-15 13:17:20,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:17:20" (1/1) ... [2023-02-15 13:17:20,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:17:20" (1/1) ... [2023-02-15 13:17:20,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:17:20" (1/1) ... [2023-02-15 13:17:20,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:17:20" (1/1) ... [2023-02-15 13:17:20,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:17:20" (1/1) ... [2023-02-15 13:17:20,932 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:17:20" (1/1) ... [2023-02-15 13:17:20,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:17:20" (1/1) ... [2023-02-15 13:17:20,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:17:20,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:17:20,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:17:20,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:17:20,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:17:20" (1/1) ... [2023-02-15 13:17:20,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:17:20,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:17:20,988 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) [2023-02-15 13:17:20,995 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 [2023-02-15 13:17:21,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:17:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:17:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:17:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:17:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:17:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:17:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:17:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:17:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:17:21,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:17:21,100 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:17:21,102 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:17:21,477 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:17:21,483 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:17:21,483 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 13:17:21,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:17:21 BoogieIcfgContainer [2023-02-15 13:17:21,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:17:21,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:17:21,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:17:21,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:17:21,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:17:20" (1/3) ... [2023-02-15 13:17:21,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8b286f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:17:21, skipping insertion in model container [2023-02-15 13:17:21,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:17:20" (2/3) ... [2023-02-15 13:17:21,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8b286f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:17:21, skipping insertion in model container [2023-02-15 13:17:21,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:17:21" (3/3) ... [2023-02-15 13:17:21,492 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2023-02-15 13:17:21,504 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:17:21,504 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2023-02-15 13:17:21,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:17:21,558 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@341d5562, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:17:21,558 INFO L358 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2023-02-15 13:17:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 76 states have (on average 2.0921052631578947) internal successors, (159), 142 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:21,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:17:21,567 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:21,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:17:21,568 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:21,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:21,573 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 13:17:21,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:21,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097768064] [2023-02-15 13:17:21,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:21,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:21,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:21,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097768064] [2023-02-15 13:17:21,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097768064] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:21,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:21,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:17:21,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435895523] [2023-02-15 13:17:21,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:21,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:17:21,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:21,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:17:21,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:17:21,781 INFO L87 Difference]: Start difference. First operand has 143 states, 76 states have (on average 2.0921052631578947) internal successors, (159), 142 states have internal predecessors, (159), 0 states have call successors, (0), 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) [2023-02-15 13:17:21,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:21,924 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2023-02-15 13:17:21,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:17:21,927 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 [2023-02-15 13:17:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:21,945 INFO L225 Difference]: With dead ends: 145 [2023-02-15 13:17:21,946 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 13:17:21,947 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 [2023-02-15 13:17:21,949 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:21,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 84 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:17:21,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 13:17:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2023-02-15 13:17:21,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 78 states have (on average 1.8846153846153846) 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) [2023-02-15 13:17:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2023-02-15 13:17:21,995 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 3 [2023-02-15 13:17:21,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:21,996 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2023-02-15 13:17:21,996 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) [2023-02-15 13:17:21,996 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2023-02-15 13:17:21,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:17:21,996 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:21,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:17:21,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:17:21,997 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:21,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:21,998 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 13:17:21,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:21,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312233684] [2023-02-15 13:17:21,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:21,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:22,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:22,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312233684] [2023-02-15 13:17:22,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312233684] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:22,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:22,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:17:22,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861939788] [2023-02-15 13:17:22,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:22,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:17:22,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:22,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:17:22,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:17:22,067 INFO L87 Difference]: Start difference. First operand 135 states and 147 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) [2023-02-15 13:17:22,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:22,181 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2023-02-15 13:17:22,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:17:22,182 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 [2023-02-15 13:17:22,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:22,185 INFO L225 Difference]: With dead ends: 131 [2023-02-15 13:17:22,186 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 13:17:22,187 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 [2023-02-15 13:17:22,188 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 105 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:22,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 97 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:17:22,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 13:17:22,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2023-02-15 13:17:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.7820512820512822) internal successors, (139), 126 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) [2023-02-15 13:17:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2023-02-15 13:17:22,195 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 3 [2023-02-15 13:17:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:22,195 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2023-02-15 13:17:22,195 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) [2023-02-15 13:17:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2023-02-15 13:17:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 13:17:22,196 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:22,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:17:22,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:17:22,197 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:22,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash 171916845, now seen corresponding path program 1 times [2023-02-15 13:17:22,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:22,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243770959] [2023-02-15 13:17:22,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:22,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:22,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243770959] [2023-02-15 13:17:22,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243770959] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:22,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:22,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:17:22,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695033019] [2023-02-15 13:17:22,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:22,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:17:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:22,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:17:22,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:17:22,381 INFO L87 Difference]: Start difference. First operand 127 states and 139 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) [2023-02-15 13:17:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:22,522 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2023-02-15 13:17:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:17:22,522 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 [2023-02-15 13:17:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:22,524 INFO L225 Difference]: With dead ends: 171 [2023-02-15 13:17:22,524 INFO L226 Difference]: Without dead ends: 171 [2023-02-15 13:17:22,527 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 [2023-02-15 13:17:22,529 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 52 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:22,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 313 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:17:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-15 13:17:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 126. [2023-02-15 13:17:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 78 states have (on average 1.7692307692307692) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:22,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2023-02-15 13:17:22,549 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 11 [2023-02-15 13:17:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:22,550 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2023-02-15 13:17:22,550 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) [2023-02-15 13:17:22,550 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2023-02-15 13:17:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 13:17:22,551 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:22,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:17:22,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:17:22,551 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:22,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:22,552 INFO L85 PathProgramCache]: Analyzing trace with hash 171916846, now seen corresponding path program 1 times [2023-02-15 13:17:22,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:22,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475281793] [2023-02-15 13:17:22,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:22,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:22,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:22,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475281793] [2023-02-15 13:17:22,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475281793] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:22,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:22,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:17:22,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649201868] [2023-02-15 13:17:22,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:22,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:17:22,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:22,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:17:22,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:17:22,762 INFO L87 Difference]: Start difference. First operand 126 states and 138 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) [2023-02-15 13:17:22,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:22,893 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2023-02-15 13:17:22,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:17:22,893 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 [2023-02-15 13:17:22,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:22,894 INFO L225 Difference]: With dead ends: 125 [2023-02-15 13:17:22,894 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 13:17:22,894 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 [2023-02-15 13:17:22,895 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 3 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:22,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 349 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:17:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 13:17:22,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-02-15 13:17:22,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 78 states have (on average 1.7564102564102564) internal successors, (137), 124 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:22,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2023-02-15 13:17:22,899 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 11 [2023-02-15 13:17:22,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:22,899 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2023-02-15 13:17:22,899 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) [2023-02-15 13:17:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2023-02-15 13:17:22,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:17:22,900 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:22,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:17:22,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:17:22,900 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:22,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:22,901 INFO L85 PathProgramCache]: Analyzing trace with hash -468215045, now seen corresponding path program 1 times [2023-02-15 13:17:22,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:22,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107816777] [2023-02-15 13:17:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:22,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:22,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:22,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107816777] [2023-02-15 13:17:22,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107816777] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:22,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:22,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:17:22,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913211451] [2023-02-15 13:17:22,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:22,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:17:22,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:22,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:17:22,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:17:22,980 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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) [2023-02-15 13:17:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:23,087 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2023-02-15 13:17:23,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:17:23,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 [2023-02-15 13:17:23,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:23,088 INFO L225 Difference]: With dead ends: 127 [2023-02-15 13:17:23,088 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 13:17:23,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:17:23,089 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 174 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:23,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 73 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:17:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 13:17:23,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2023-02-15 13:17:23,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 117 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 135 transitions. [2023-02-15 13:17:23,093 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 135 transitions. Word has length 12 [2023-02-15 13:17:23,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:23,093 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 135 transitions. [2023-02-15 13:17:23,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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) [2023-02-15 13:17:23,093 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2023-02-15 13:17:23,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:17:23,094 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:23,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:17:23,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:17:23,094 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:23,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:23,095 INFO L85 PathProgramCache]: Analyzing trace with hash -468215044, now seen corresponding path program 1 times [2023-02-15 13:17:23,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:23,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247449501] [2023-02-15 13:17:23,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:23,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:23,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:23,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247449501] [2023-02-15 13:17:23,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247449501] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:23,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:23,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:17:23,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963628246] [2023-02-15 13:17:23,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:23,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:17:23,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:23,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:17:23,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:17:23,199 INFO L87 Difference]: Start difference. First operand 118 states and 135 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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) [2023-02-15 13:17:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:23,374 INFO L93 Difference]: Finished difference Result 171 states and 189 transitions. [2023-02-15 13:17:23,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:17:23,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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 [2023-02-15 13:17:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:23,375 INFO L225 Difference]: With dead ends: 171 [2023-02-15 13:17:23,375 INFO L226 Difference]: Without dead ends: 171 [2023-02-15 13:17:23,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:17:23,376 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 178 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:23,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 151 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:17:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-15 13:17:23,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 146. [2023-02-15 13:17:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 112 states have (on average 1.5267857142857142) internal successors, (171), 145 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:23,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2023-02-15 13:17:23,379 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 12 [2023-02-15 13:17:23,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:23,380 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2023-02-15 13:17:23,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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) [2023-02-15 13:17:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2023-02-15 13:17:23,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:17:23,380 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:23,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:17:23,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 13:17:23,381 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:23,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:23,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2003220227, now seen corresponding path program 1 times [2023-02-15 13:17:23,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:23,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579607599] [2023-02-15 13:17:23,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:23,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:23,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:23,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579607599] [2023-02-15 13:17:23,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579607599] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:23,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:23,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:17:23,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146441240] [2023-02-15 13:17:23,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:23,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:17:23,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:23,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:17:23,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:17:23,495 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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) [2023-02-15 13:17:23,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:23,648 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2023-02-15 13:17:23,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:17:23,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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 [2023-02-15 13:17:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:23,649 INFO L225 Difference]: With dead ends: 146 [2023-02-15 13:17:23,649 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 13:17:23,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:17:23,651 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 63 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:23,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 273 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:17:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 13:17:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2023-02-15 13:17:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.5178571428571428) internal successors, (170), 144 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2023-02-15 13:17:23,663 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 16 [2023-02-15 13:17:23,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:23,664 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2023-02-15 13:17:23,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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) [2023-02-15 13:17:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2023-02-15 13:17:23,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:17:23,665 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:23,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:17:23,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 13:17:23,666 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:23,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:23,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2003220226, now seen corresponding path program 1 times [2023-02-15 13:17:23,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:23,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390071024] [2023-02-15 13:17:23,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:23,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:23,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:23,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390071024] [2023-02-15 13:17:23,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390071024] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:23,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:23,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:17:23,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003463037] [2023-02-15 13:17:23,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:23,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:17:23,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:23,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:17:23,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:17:23,842 INFO L87 Difference]: Start difference. First operand 145 states and 170 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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) [2023-02-15 13:17:24,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:24,022 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2023-02-15 13:17:24,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:17:24,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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 [2023-02-15 13:17:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:24,023 INFO L225 Difference]: With dead ends: 137 [2023-02-15 13:17:24,023 INFO L226 Difference]: Without dead ends: 137 [2023-02-15 13:17:24,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:17:24,023 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 25 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:24,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 323 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:17:24,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-15 13:17:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2023-02-15 13:17:24,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.439252336448598) internal successors, (154), 129 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2023-02-15 13:17:24,026 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 16 [2023-02-15 13:17:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:24,026 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2023-02-15 13:17:24,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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) [2023-02-15 13:17:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2023-02-15 13:17:24,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:17:24,026 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:24,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:17:24,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 13:17:24,026 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:24,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:24,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2123452236, now seen corresponding path program 1 times [2023-02-15 13:17:24,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:24,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017134516] [2023-02-15 13:17:24,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:24,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:24,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:24,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017134516] [2023-02-15 13:17:24,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017134516] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:24,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:24,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:17:24,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226558963] [2023-02-15 13:17:24,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:24,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:17:24,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:24,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:17:24,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:17:24,052 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:24,124 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2023-02-15 13:17:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:17:24,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2023-02-15 13:17:24,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:24,125 INFO L225 Difference]: With dead ends: 154 [2023-02-15 13:17:24,125 INFO L226 Difference]: Without dead ends: 154 [2023-02-15 13:17:24,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 [2023-02-15 13:17:24,126 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 155 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:24,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 154 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:17:24,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-02-15 13:17:24,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2023-02-15 13:17:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.4205607476635513) internal successors, (152), 129 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:24,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2023-02-15 13:17:24,128 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 17 [2023-02-15 13:17:24,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:24,129 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2023-02-15 13:17:24,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2023-02-15 13:17:24,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 13:17:24,129 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:24,129 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] [2023-02-15 13:17:24,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 13:17:24,130 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:24,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:24,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1866791259, now seen corresponding path program 1 times [2023-02-15 13:17:24,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:24,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073468216] [2023-02-15 13:17:24,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:24,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:24,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:24,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073468216] [2023-02-15 13:17:24,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073468216] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:24,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:24,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:17:24,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811422114] [2023-02-15 13:17:24,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:24,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:17:24,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:24,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:17:24,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:17:24,162 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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) [2023-02-15 13:17:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:24,177 INFO L93 Difference]: Finished difference Result 156 states and 186 transitions. [2023-02-15 13:17:24,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:17:24,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 [2023-02-15 13:17:24,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:24,178 INFO L225 Difference]: With dead ends: 156 [2023-02-15 13:17:24,178 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 13:17:24,179 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 [2023-02-15 13:17:24,179 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 21 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 304 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 [2023-02-15 13:17:24,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 304 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:17:24,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 13:17:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2023-02-15 13:17:24,181 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) [2023-02-15 13:17:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2023-02-15 13:17:24,182 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 20 [2023-02-15 13:17:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:24,182 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2023-02-15 13:17:24,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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) [2023-02-15 13:17:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2023-02-15 13:17:24,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:17:24,183 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:24,183 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] [2023-02-15 13:17:24,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 13:17:24,183 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:24,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:24,184 INFO L85 PathProgramCache]: Analyzing trace with hash 72886850, now seen corresponding path program 1 times [2023-02-15 13:17:24,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:24,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645309503] [2023-02-15 13:17:24,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:24,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:24,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:24,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645309503] [2023-02-15 13:17:24,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645309503] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:24,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:24,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:17:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225915824] [2023-02-15 13:17:24,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:24,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:17:24,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:24,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:17:24,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:17:24,273 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:24,517 INFO L93 Difference]: Finished difference Result 247 states and 287 transitions. [2023-02-15 13:17:24,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:17:24,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 13:17:24,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:24,518 INFO L225 Difference]: With dead ends: 247 [2023-02-15 13:17:24,518 INFO L226 Difference]: Without dead ends: 247 [2023-02-15 13:17:24,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:17:24,519 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 241 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:24,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 274 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:17:24,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-02-15 13:17:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 148. [2023-02-15 13:17:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 125 states have (on average 1.392) internal successors, (174), 147 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) [2023-02-15 13:17:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2023-02-15 13:17:24,522 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 22 [2023-02-15 13:17:24,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:24,522 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2023-02-15 13:17:24,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2023-02-15 13:17:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:17:24,522 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:24,522 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] [2023-02-15 13:17:24,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 13:17:24,523 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:24,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:24,523 INFO L85 PathProgramCache]: Analyzing trace with hash 72886851, now seen corresponding path program 1 times [2023-02-15 13:17:24,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:24,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798882954] [2023-02-15 13:17:24,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:24,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:24,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:24,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798882954] [2023-02-15 13:17:24,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798882954] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:24,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:24,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:17:24,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371724798] [2023-02-15 13:17:24,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:24,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:17:24,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:24,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:17:24,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:17:24,721 INFO L87 Difference]: Start difference. First operand 148 states and 174 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:24,996 INFO L93 Difference]: Finished difference Result 224 states and 257 transitions. [2023-02-15 13:17:24,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:17:24,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 13:17:24,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:24,998 INFO L225 Difference]: With dead ends: 224 [2023-02-15 13:17:24,998 INFO L226 Difference]: Without dead ends: 224 [2023-02-15 13:17:24,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:17:24,998 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 257 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:24,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 390 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:17:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-02-15 13:17:25,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2023-02-15 13:17:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 143 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) [2023-02-15 13:17:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2023-02-15 13:17:25,001 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 22 [2023-02-15 13:17:25,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:25,002 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2023-02-15 13:17:25,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2023-02-15 13:17:25,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:17:25,002 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:25,002 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] [2023-02-15 13:17:25,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 13:17:25,003 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:25,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:25,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1318553294, now seen corresponding path program 1 times [2023-02-15 13:17:25,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:25,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986634457] [2023-02-15 13:17:25,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:25,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:25,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:25,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986634457] [2023-02-15 13:17:25,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986634457] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:25,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:25,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:17:25,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232116749] [2023-02-15 13:17:25,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:25,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:17:25,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:25,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:17:25,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:17:25,022 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:25,027 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2023-02-15 13:17:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:17:25,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 13:17:25,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:25,029 INFO L225 Difference]: With dead ends: 146 [2023-02-15 13:17:25,029 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 13:17:25,029 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 [2023-02-15 13:17:25,029 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 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 [2023-02-15 13:17:25,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:17:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 13:17:25,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2023-02-15 13:17:25,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 145 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2023-02-15 13:17:25,032 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 22 [2023-02-15 13:17:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:25,032 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2023-02-15 13:17:25,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2023-02-15 13:17:25,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:17:25,033 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:25,033 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] [2023-02-15 13:17:25,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 13:17:25,033 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:25,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:25,034 INFO L85 PathProgramCache]: Analyzing trace with hash 116002131, now seen corresponding path program 1 times [2023-02-15 13:17:25,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:25,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684360695] [2023-02-15 13:17:25,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:25,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:25,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:25,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684360695] [2023-02-15 13:17:25,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684360695] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:25,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:25,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:17:25,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449249529] [2023-02-15 13:17:25,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:25,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:17:25,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:25,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:17:25,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:17:25,195 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:25,426 INFO L93 Difference]: Finished difference Result 219 states and 250 transitions. [2023-02-15 13:17:25,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:17:25,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-15 13:17:25,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:25,428 INFO L225 Difference]: With dead ends: 219 [2023-02-15 13:17:25,428 INFO L226 Difference]: Without dead ends: 219 [2023-02-15 13:17:25,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:17:25,429 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 176 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:25,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 365 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:17:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-15 13:17:25,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 152. [2023-02-15 13:17:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 129 states have (on average 1.372093023255814) internal successors, (177), 151 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) [2023-02-15 13:17:25,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2023-02-15 13:17:25,432 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 24 [2023-02-15 13:17:25,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:25,433 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2023-02-15 13:17:25,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2023-02-15 13:17:25,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:17:25,435 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:25,436 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] [2023-02-15 13:17:25,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 13:17:25,436 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:25,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:25,437 INFO L85 PathProgramCache]: Analyzing trace with hash 913286409, now seen corresponding path program 1 times [2023-02-15 13:17:25,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:25,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623521335] [2023-02-15 13:17:25,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:25,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:25,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:25,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623521335] [2023-02-15 13:17:25,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623521335] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:25,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:25,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:17:25,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825963096] [2023-02-15 13:17:25,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:25,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:17:25,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:25,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:17:25,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:17:25,528 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:25,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:25,663 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2023-02-15 13:17:25,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:17:25,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-15 13:17:25,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:25,664 INFO L225 Difference]: With dead ends: 158 [2023-02-15 13:17:25,664 INFO L226 Difference]: Without dead ends: 158 [2023-02-15 13:17:25,664 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 [2023-02-15 13:17:25,665 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 9 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:25,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 286 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:17:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-15 13:17:25,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2023-02-15 13:17:25,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.3643410852713178) internal successors, (176), 150 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) [2023-02-15 13:17:25,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 176 transitions. [2023-02-15 13:17:25,667 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 176 transitions. Word has length 24 [2023-02-15 13:17:25,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:25,667 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 176 transitions. [2023-02-15 13:17:25,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:25,667 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 176 transitions. [2023-02-15 13:17:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:17:25,668 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:25,668 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] [2023-02-15 13:17:25,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 13:17:25,668 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:25,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:25,669 INFO L85 PathProgramCache]: Analyzing trace with hash 913286410, now seen corresponding path program 1 times [2023-02-15 13:17:25,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:25,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682887783] [2023-02-15 13:17:25,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:25,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:25,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682887783] [2023-02-15 13:17:25,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682887783] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:25,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:25,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:17:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389570032] [2023-02-15 13:17:25,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:25,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:17:25,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:25,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:17:25,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:17:25,797 INFO L87 Difference]: Start difference. First operand 151 states and 176 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:25,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:25,874 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2023-02-15 13:17:25,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:17:25,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-15 13:17:25,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:25,875 INFO L225 Difference]: With dead ends: 150 [2023-02-15 13:17:25,875 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 13:17:25,876 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 [2023-02-15 13:17:25,876 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 3 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:25,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 275 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:17:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 13:17:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2023-02-15 13:17:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 129 states have (on average 1.3565891472868217) 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) [2023-02-15 13:17:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2023-02-15 13:17:25,878 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 24 [2023-02-15 13:17:25,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:25,878 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2023-02-15 13:17:25,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2023-02-15 13:17:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 13:17:25,879 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:25,879 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] [2023-02-15 13:17:25,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 13:17:25,879 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:25,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:25,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1848177146, now seen corresponding path program 1 times [2023-02-15 13:17:25,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:25,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277317798] [2023-02-15 13:17:25,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:25,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:26,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:26,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:26,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277317798] [2023-02-15 13:17:26,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277317798] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:26,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:26,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:17:26,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316774723] [2023-02-15 13:17:26,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:26,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:17:26,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:26,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:17:26,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:17:26,014 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:26,301 INFO L93 Difference]: Finished difference Result 309 states and 356 transitions. [2023-02-15 13:17:26,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 13:17:26,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2023-02-15 13:17:26,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:26,302 INFO L225 Difference]: With dead ends: 309 [2023-02-15 13:17:26,302 INFO L226 Difference]: Without dead ends: 309 [2023-02-15 13:17:26,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2023-02-15 13:17:26,303 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 350 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:26,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 449 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:17:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-02-15 13:17:26,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 163. [2023-02-15 13:17:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 142 states have (on average 1.352112676056338) internal successors, (192), 162 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:26,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2023-02-15 13:17:26,305 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 26 [2023-02-15 13:17:26,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:26,305 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2023-02-15 13:17:26,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2023-02-15 13:17:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 13:17:26,306 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:26,306 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] [2023-02-15 13:17:26,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 13:17:26,306 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:26,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:26,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1848177147, now seen corresponding path program 1 times [2023-02-15 13:17:26,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:26,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512463257] [2023-02-15 13:17:26,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:26,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:26,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:26,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:26,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512463257] [2023-02-15 13:17:26,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512463257] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:26,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:26,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:17:26,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899082110] [2023-02-15 13:17:26,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:26,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:17:26,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:26,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:17:26,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:17:26,612 INFO L87 Difference]: Start difference. First operand 163 states and 192 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:26,988 INFO L93 Difference]: Finished difference Result 252 states and 290 transitions. [2023-02-15 13:17:26,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:17:26,988 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2023-02-15 13:17:26,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:26,989 INFO L225 Difference]: With dead ends: 252 [2023-02-15 13:17:26,989 INFO L226 Difference]: Without dead ends: 252 [2023-02-15 13:17:26,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2023-02-15 13:17:26,989 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 229 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:26,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 557 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:17:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-02-15 13:17:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 163. [2023-02-15 13:17:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 162 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) [2023-02-15 13:17:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 191 transitions. [2023-02-15 13:17:26,992 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 191 transitions. Word has length 26 [2023-02-15 13:17:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:26,992 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 191 transitions. [2023-02-15 13:17:26,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 191 transitions. [2023-02-15 13:17:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 13:17:26,992 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:26,993 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] [2023-02-15 13:17:26,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 13:17:26,993 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:26,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:26,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1639700775, now seen corresponding path program 1 times [2023-02-15 13:17:26,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:26,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027616559] [2023-02-15 13:17:26,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:26,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:27,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:27,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027616559] [2023-02-15 13:17:27,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027616559] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:27,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:27,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:17:27,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485882527] [2023-02-15 13:17:27,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:27,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:17:27,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:27,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:17:27,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:17:27,032 INFO L87 Difference]: Start difference. First operand 163 states and 191 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:27,045 INFO L93 Difference]: Finished difference Result 175 states and 204 transitions. [2023-02-15 13:17:27,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:17:27,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2023-02-15 13:17:27,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:27,046 INFO L225 Difference]: With dead ends: 175 [2023-02-15 13:17:27,046 INFO L226 Difference]: Without dead ends: 175 [2023-02-15 13:17:27,046 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 [2023-02-15 13:17:27,047 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 10 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 299 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 [2023-02-15 13:17:27,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 299 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:17:27,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-15 13:17:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 167. [2023-02-15 13:17:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 146 states have (on average 1.3287671232876712) internal successors, (194), 166 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2023-02-15 13:17:27,049 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 26 [2023-02-15 13:17:27,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:27,049 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2023-02-15 13:17:27,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2023-02-15 13:17:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 13:17:27,050 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:27,050 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] [2023-02-15 13:17:27,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 13:17:27,050 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:27,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:27,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1067960075, now seen corresponding path program 1 times [2023-02-15 13:17:27,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:27,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876558871] [2023-02-15 13:17:27,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:27,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:27,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:27,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876558871] [2023-02-15 13:17:27,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876558871] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:27,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:27,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:17:27,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904819246] [2023-02-15 13:17:27,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:27,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:17:27,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:27,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:17:27,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:17:27,204 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:27,627 INFO L93 Difference]: Finished difference Result 247 states and 277 transitions. [2023-02-15 13:17:27,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:17:27,628 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-15 13:17:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:27,629 INFO L225 Difference]: With dead ends: 247 [2023-02-15 13:17:27,629 INFO L226 Difference]: Without dead ends: 247 [2023-02-15 13:17:27,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2023-02-15 13:17:27,629 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 360 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:27,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 478 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:17:27,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-02-15 13:17:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 167. [2023-02-15 13:17:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 146 states have (on average 1.321917808219178) internal successors, (193), 166 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2023-02-15 13:17:27,632 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 28 [2023-02-15 13:17:27,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:27,632 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2023-02-15 13:17:27,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2023-02-15 13:17:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 13:17:27,633 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:27,633 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] [2023-02-15 13:17:27,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 13:17:27,634 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:27,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:27,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1161159390, now seen corresponding path program 1 times [2023-02-15 13:17:27,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:27,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308121452] [2023-02-15 13:17:27,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:27,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:27,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:27,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308121452] [2023-02-15 13:17:27,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308121452] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:17:27,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793325889] [2023-02-15 13:17:27,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:27,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:17:27,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:17:27,740 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) [2023-02-15 13:17:27,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 13:17:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:27,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 13:17:27,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:17:27,911 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:27,914 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:27,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:17:27,959 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:27,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:17:27,966 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:27,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:17:27,976 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:27,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:17:27,984 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:28,067 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:17:28,069 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:28,074 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:17:28,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:28,076 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:28,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:17:28,483 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 13:17:28,487 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:28,496 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 13:17:28,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:17:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:28,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793325889] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:17:28,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:17:28,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2023-02-15 13:17:28,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642091331] [2023-02-15 13:17:28,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:17:28,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:17:28,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:28,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:17:28,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:17:28,512 INFO L87 Difference]: Start difference. First operand 167 states and 193 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:28,799 INFO L93 Difference]: Finished difference Result 208 states and 237 transitions. [2023-02-15 13:17:28,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:17:28,799 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-15 13:17:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:28,800 INFO L225 Difference]: With dead ends: 208 [2023-02-15 13:17:28,800 INFO L226 Difference]: Without dead ends: 208 [2023-02-15 13:17:28,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-02-15 13:17:28,801 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 351 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:28,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 368 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:17:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-02-15 13:17:28,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2023-02-15 13:17:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 159 states have (on average 1.3081761006289307) internal successors, (208), 179 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 208 transitions. [2023-02-15 13:17:28,803 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 208 transitions. Word has length 28 [2023-02-15 13:17:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:28,804 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 208 transitions. [2023-02-15 13:17:28,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 208 transitions. [2023-02-15 13:17:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 13:17:28,804 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:28,804 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] [2023-02-15 13:17:28,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 13:17:29,010 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,SelfDestructingSolverStorable20 [2023-02-15 13:17:29,010 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:29,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:29,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1511540264, now seen corresponding path program 1 times [2023-02-15 13:17:29,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:29,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496006985] [2023-02-15 13:17:29,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:29,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:29,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:29,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496006985] [2023-02-15 13:17:29,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496006985] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:29,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:29,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:17:29,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726417564] [2023-02-15 13:17:29,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:29,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:17:29,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:29,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:17:29,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:17:29,115 INFO L87 Difference]: Start difference. First operand 180 states and 208 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:29,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:29,322 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2023-02-15 13:17:29,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:17:29,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-15 13:17:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:29,324 INFO L225 Difference]: With dead ends: 225 [2023-02-15 13:17:29,324 INFO L226 Difference]: Without dead ends: 225 [2023-02-15 13:17:29,324 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 [2023-02-15 13:17:29,325 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 78 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:29,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 433 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:17:29,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-15 13:17:29,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 186. [2023-02-15 13:17:29,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 165 states have (on average 1.303030303030303) internal successors, (215), 185 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 215 transitions. [2023-02-15 13:17:29,328 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 215 transitions. Word has length 30 [2023-02-15 13:17:29,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:29,328 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 215 transitions. [2023-02-15 13:17:29,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:29,328 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 215 transitions. [2023-02-15 13:17:29,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 13:17:29,328 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:29,329 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] [2023-02-15 13:17:29,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 13:17:29,337 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:29,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:29,338 INFO L85 PathProgramCache]: Analyzing trace with hash 238082658, now seen corresponding path program 1 times [2023-02-15 13:17:29,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:29,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508634600] [2023-02-15 13:17:29,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:29,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:29,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:29,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508634600] [2023-02-15 13:17:29,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508634600] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:17:29,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:17:29,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 13:17:29,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122788385] [2023-02-15 13:17:29,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:17:29,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:17:29,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:29,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:17:29,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:17:29,547 INFO L87 Difference]: Start difference. First operand 186 states and 215 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:30,083 INFO L93 Difference]: Finished difference Result 224 states and 250 transitions. [2023-02-15 13:17:30,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 13:17:30,083 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-15 13:17:30,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:30,084 INFO L225 Difference]: With dead ends: 224 [2023-02-15 13:17:30,084 INFO L226 Difference]: Without dead ends: 224 [2023-02-15 13:17:30,084 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 [2023-02-15 13:17:30,085 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 201 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:30,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 733 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:17:30,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-02-15 13:17:30,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 183. [2023-02-15 13:17:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 182 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 210 transitions. [2023-02-15 13:17:30,087 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 210 transitions. Word has length 33 [2023-02-15 13:17:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:30,087 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 210 transitions. [2023-02-15 13:17:30,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2023-02-15 13:17:30,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 13:17:30,087 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:30,088 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] [2023-02-15 13:17:30,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 13:17:30,088 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:30,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:30,088 INFO L85 PathProgramCache]: Analyzing trace with hash 745727206, now seen corresponding path program 1 times [2023-02-15 13:17:30,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:30,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039576205] [2023-02-15 13:17:30,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:30,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:30,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:30,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039576205] [2023-02-15 13:17:30,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039576205] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:17:30,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765619921] [2023-02-15 13:17:30,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:30,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:17:30,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:17:30,517 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) [2023-02-15 13:17:30,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 13:17:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:30,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 13:17:30,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:17:30,645 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:30,661 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:30,703 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:17:30,703 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:30,738 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 13:17:30,739 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:30,883 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:30,883 INFO L350 Elim1Store]: Elim1 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 73 treesize of output 63 [2023-02-15 13:17:30,964 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:30,965 INFO L350 Elim1Store]: Elim1 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 73 treesize of output 63 [2023-02-15 13:17:30,989 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:30,992 INFO L350 Elim1Store]: Elim1 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 73 treesize of output 63 [2023-02-15 13:17:31,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:31,197 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 36 [2023-02-15 13:17:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:31,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:17:31,270 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_677) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1)) is different from false [2023-02-15 13:17:31,315 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (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_677) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1)) is different from false [2023-02-15 13:17:31,399 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_677 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_7| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_7| 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_7|) 0)) (not (= (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) 1)) (= (select .cse0 (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_7|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_7| v_ArrVal_677) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1)))) is different from false [2023-02-15 13:17:31,416 INFO L321 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2023-02-15 13:17:31,416 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 36 [2023-02-15 13:17:31,422 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:17:31,423 INFO L350 Elim1Store]: Elim1 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 85 treesize of output 49 [2023-02-15 13:17:31,426 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 12 [2023-02-15 13:17:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:33,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765619921] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:17:33,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:17:33,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2023-02-15 13:17:33,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83716093] [2023-02-15 13:17:33,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:17:33,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 13:17:33,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:33,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 13:17:33,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=617, Unknown=10, NotChecked=162, Total=930 [2023-02-15 13:17:33,473 INFO L87 Difference]: Start difference. First operand 183 states and 210 transitions. Second operand has 31 states, 30 states have (on average 3.1333333333333333) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:36,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 13:17:38,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 13:17:41,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 13:17:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:17:48,276 INFO L93 Difference]: Finished difference Result 454 states and 510 transitions. [2023-02-15 13:17:48,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-02-15 13:17:48,277 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.1333333333333333) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 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 [2023-02-15 13:17:48,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:17:48,278 INFO L225 Difference]: With dead ends: 454 [2023-02-15 13:17:48,278 INFO L226 Difference]: Without dead ends: 454 [2023-02-15 13:17:48,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=814, Invalid=3206, Unknown=24, NotChecked=378, Total=4422 [2023-02-15 13:17:48,280 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 729 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 86 mSolverCounterUnsat, 43 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 2329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 43 IncrementalHoareTripleChecker+Unknown, 592 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:17:48,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1390 Invalid, 2329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1608 Invalid, 43 Unknown, 592 Unchecked, 7.1s Time] [2023-02-15 13:17:48,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2023-02-15 13:17:48,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 216. [2023-02-15 13:17:48,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 195 states have (on average 1.2871794871794873) internal successors, (251), 215 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 251 transitions. [2023-02-15 13:17:48,284 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 251 transitions. Word has length 34 [2023-02-15 13:17:48,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:17:48,285 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 251 transitions. [2023-02-15 13:17:48,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.1333333333333333) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:48,285 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 251 transitions. [2023-02-15 13:17:48,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 13:17:48,285 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:17:48,285 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] [2023-02-15 13:17:48,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 13:17:48,492 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 [2023-02-15 13:17:48,493 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:17:48,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:17:48,493 INFO L85 PathProgramCache]: Analyzing trace with hash 745727207, now seen corresponding path program 1 times [2023-02-15 13:17:48,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:17:48,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789748283] [2023-02-15 13:17:48,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:48,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:17:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:48,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:17:48,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789748283] [2023-02-15 13:17:48,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789748283] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:17:48,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387894511] [2023-02-15 13:17:48,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:17:48,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:17:48,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:17:48,893 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) [2023-02-15 13:17:48,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 13:17:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:17:48,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-15 13:17:48,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:17:48,992 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:49,007 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:49,012 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:49,085 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:17:49,086 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:49,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:17:49,127 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:49,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:17:49,134 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:49,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:17:49,269 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:49,279 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:49,280 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:49,336 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:49,337 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:49,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:17:49,342 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:49,364 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:17:49,365 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:49,369 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:49,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:17:49,509 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:49,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:17:49,515 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:49,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:17:49,641 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_783 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_783) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-02-15 13:17:49,785 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_783 (Array Int Int))) (= (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_783) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (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_784) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-15 13:17:53,697 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:17:53,701 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:53,701 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 31 [2023-02-15 13:17:53,705 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:17:53,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:17:53,707 INFO L350 Elim1Store]: Elim1 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 54 treesize of output 30 [2023-02-15 13:17:53,710 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:17:53,715 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:17:53,717 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:17:53,718 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 1 [2023-02-15 13:17:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:17:53,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387894511] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:17:53,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:17:53,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 34 [2023-02-15 13:17:53,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669681204] [2023-02-15 13:17:53,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:17:53,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 13:17:53,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:17:53,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 13:17:53,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=863, Unknown=28, NotChecked=122, Total=1122 [2023-02-15 13:17:53,756 INFO L87 Difference]: Start difference. First operand 216 states and 251 transitions. Second operand has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:17:59,499 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse0 (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_783 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_783) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select .cse2 .cse3) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse3)) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-15 13:17:59,649 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_10| Int)) (or (forall ((v_ArrVal_783 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_10|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_10| v_ArrVal_783) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_10|) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_783 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_783) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select .cse0 .cse3) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select .cse4 .cse3)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) 0) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_10| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_10|) 0)) (forall ((v_ArrVal_784 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_10| v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-15 13:17:59,661 WARN L837 $PredicateComparison]: unable to prove that (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| 4))) (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_783 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_783) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-15 13:18:06,645 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse0 (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_783 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_783) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select .cse2 .cse3) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse3)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) 0) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-15 13:18:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:18:08,436 INFO L93 Difference]: Finished difference Result 863 states and 960 transitions. [2023-02-15 13:18:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-02-15 13:18:08,436 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 0 states have call successors, (0), 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 [2023-02-15 13:18:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:18:08,439 INFO L225 Difference]: With dead ends: 863 [2023-02-15 13:18:08,439 INFO L226 Difference]: Without dead ends: 863 [2023-02-15 13:18:08,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 130 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 5214 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=2480, Invalid=13218, Unknown=76, NotChecked=1518, Total=17292 [2023-02-15 13:18:08,443 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 1516 mSDsluCounter, 1811 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 246 mSolverCounterUnsat, 66 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 3819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 66 IncrementalHoareTripleChecker+Unknown, 793 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:18:08,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1891 Invalid, 3819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 2714 Invalid, 66 Unknown, 793 Unchecked, 2.3s Time] [2023-02-15 13:18:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2023-02-15 13:18:08,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 296. [2023-02-15 13:18:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 275 states have (on average 1.2618181818181817) internal successors, (347), 295 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:18:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 347 transitions. [2023-02-15 13:18:08,449 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 347 transitions. Word has length 34 [2023-02-15 13:18:08,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:18:08,449 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 347 transitions. [2023-02-15 13:18:08,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:18:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 347 transitions. [2023-02-15 13:18:08,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 13:18:08,454 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:18:08,455 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] [2023-02-15 13:18:08,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 13:18:08,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:18:08,658 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:18:08,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:18:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1970599096, now seen corresponding path program 1 times [2023-02-15 13:18:08,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:18:08,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741627036] [2023-02-15 13:18:08,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:18:08,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:18:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:18:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:18:08,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:18:08,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741627036] [2023-02-15 13:18:08,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741627036] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:18:08,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:18:08,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:18:08,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198625430] [2023-02-15 13:18:08,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:18:08,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:18:08,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:18:08,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:18:08,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:18:08,725 INFO L87 Difference]: Start difference. First operand 296 states and 347 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:18:08,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:18:08,801 INFO L93 Difference]: Finished difference Result 310 states and 355 transitions. [2023-02-15 13:18:08,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:18:08,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-15 13:18:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:18:08,802 INFO L225 Difference]: With dead ends: 310 [2023-02-15 13:18:08,802 INFO L226 Difference]: Without dead ends: 310 [2023-02-15 13:18:08,802 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 [2023-02-15 13:18:08,803 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 116 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:18:08,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 134 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:18:08,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2023-02-15 13:18:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 298. [2023-02-15 13:18:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 277 states have (on average 1.259927797833935) internal successors, (349), 297 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) [2023-02-15 13:18:08,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 349 transitions. [2023-02-15 13:18:08,806 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 349 transitions. Word has length 35 [2023-02-15 13:18:08,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:18:08,806 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 349 transitions. [2023-02-15 13:18:08,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:18:08,806 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 349 transitions. [2023-02-15 13:18:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 13:18:08,806 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:18:08,806 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] [2023-02-15 13:18:08,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-15 13:18:08,807 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:18:08,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:18:08,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1970588111, now seen corresponding path program 1 times [2023-02-15 13:18:08,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:18:08,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235257268] [2023-02-15 13:18:08,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:18:08,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:18:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:18:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:18:09,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:18:09,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235257268] [2023-02-15 13:18:09,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235257268] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:18:09,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661463915] [2023-02-15 13:18:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:18:09,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:18:09,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:18:09,084 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) [2023-02-15 13:18:09,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 13:18:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:18:09,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 13:18:09,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:18:09,211 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:09,339 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:18:09,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:18:09,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661463915] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:18:09,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:18:09,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2023-02-15 13:18:09,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63769384] [2023-02-15 13:18:09,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:18:09,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:18:09,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:18:09,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:18:09,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:18:09,350 INFO L87 Difference]: Start difference. First operand 298 states and 349 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:18:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:18:09,558 INFO L93 Difference]: Finished difference Result 331 states and 383 transitions. [2023-02-15 13:18:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:18:09,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-15 13:18:09,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:18:09,560 INFO L225 Difference]: With dead ends: 331 [2023-02-15 13:18:09,560 INFO L226 Difference]: Without dead ends: 331 [2023-02-15 13:18:09,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:18:09,560 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 161 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:18:09,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 317 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:18:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-02-15 13:18:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 315. [2023-02-15 13:18:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 294 states have (on average 1.248299319727891) internal successors, (367), 314 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:18:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 367 transitions. [2023-02-15 13:18:09,564 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 367 transitions. Word has length 35 [2023-02-15 13:18:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:18:09,564 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 367 transitions. [2023-02-15 13:18:09,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:18:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 367 transitions. [2023-02-15 13:18:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 13:18:09,565 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:18:09,565 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] [2023-02-15 13:18:09,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:18:09,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 13:18:09,766 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:18:09,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:18:09,767 INFO L85 PathProgramCache]: Analyzing trace with hash 958689536, now seen corresponding path program 1 times [2023-02-15 13:18:09,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:18:09,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763056812] [2023-02-15 13:18:09,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:18:09,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:18:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:18:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:18:10,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:18:10,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763056812] [2023-02-15 13:18:10,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763056812] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:18:10,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414445390] [2023-02-15 13:18:10,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:18:10,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:18:10,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:18:10,022 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) [2023-02-15 13:18:10,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 13:18:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:18:10,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 13:18:10,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:18:10,127 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:10,140 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:10,249 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:18:10,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:18:10,517 INFO L350 Elim1Store]: Elim1 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 18 [2023-02-15 13:18:10,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 92 [2023-02-15 13:18:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:18:10,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414445390] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 13:18:10,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:18:10,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 8] total 22 [2023-02-15 13:18:10,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507233785] [2023-02-15 13:18:10,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:18:10,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:18:10,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:18:10,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:18:10,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2023-02-15 13:18:10,558 INFO L87 Difference]: Start difference. First operand 315 states and 367 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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) [2023-02-15 13:18:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:18:10,888 INFO L93 Difference]: Finished difference Result 327 states and 379 transitions. [2023-02-15 13:18:10,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:18:10,889 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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 [2023-02-15 13:18:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:18:10,890 INFO L225 Difference]: With dead ends: 327 [2023-02-15 13:18:10,890 INFO L226 Difference]: Without dead ends: 327 [2023-02-15 13:18:10,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2023-02-15 13:18:10,890 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 223 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:18:10,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 462 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:18:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-02-15 13:18:10,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 313. [2023-02-15 13:18:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 292 states have (on average 1.2465753424657535) internal successors, (364), 312 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:18:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 364 transitions. [2023-02-15 13:18:10,894 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 364 transitions. Word has length 36 [2023-02-15 13:18:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:18:10,894 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 364 transitions. [2023-02-15 13:18:10,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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) [2023-02-15 13:18:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 364 transitions. [2023-02-15 13:18:10,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 13:18:10,895 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:18:10,895 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] [2023-02-15 13:18:10,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 13:18:11,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-15 13:18:11,110 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:18:11,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:18:11,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1824477449, now seen corresponding path program 1 times [2023-02-15 13:18:11,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:18:11,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128296485] [2023-02-15 13:18:11,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:18:11,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:18:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:18:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:18:11,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:18:11,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128296485] [2023-02-15 13:18:11,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128296485] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:18:11,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161860771] [2023-02-15 13:18:11,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:18:11,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:18:11,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:18:11,753 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) [2023-02-15 13:18:11,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 13:18:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:18:11,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 13:18:11,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:18:11,915 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:11,948 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:11,955 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:12,040 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:18:12,040 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:12,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:18:12,082 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:12,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:18:12,092 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:12,275 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:18:12,276 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:12,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:18:12,283 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:12,347 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:18:12,347 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:12,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:18:12,352 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:12,376 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:18:12,377 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:12,381 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:12,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:18:12,594 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:12,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:18:12,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:18:12,616 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:18:12,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:18:12,711 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_998 (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_998) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_999 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_999) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-15 13:18:12,771 WARN L837 $PredicateComparison]: unable to prove that (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| 4))) (and (forall ((v_ArrVal_999 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_999) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_998 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_998) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) is different from false [2023-02-15 13:18:12,783 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_999 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (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_999) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_998 (Array Int Int))) (= (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_998) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-02-15 13:18:16,938 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:18:16,943 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:18:16,943 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 31 [2023-02-15 13:18:16,948 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:18:16,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:18:16,951 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 28 [2023-02-15 13:18:16,954 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:16,959 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:18:16,960 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:18:16,962 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:18:16,963 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 1 [2023-02-15 13:18:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:18:17,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161860771] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:18:17,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:18:17,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2023-02-15 13:18:17,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669838398] [2023-02-15 13:18:17,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:18:17,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 13:18:17,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:18:17,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 13:18:17,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=729, Unknown=10, NotChecked=174, Total=1056 [2023-02-15 13:18:17,005 INFO L87 Difference]: Start difference. First operand 313 states and 364 transitions. Second operand has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:18:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:18:25,722 INFO L93 Difference]: Finished difference Result 759 states and 859 transitions. [2023-02-15 13:18:25,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-02-15 13:18:25,722 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 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 [2023-02-15 13:18:25,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:18:25,724 INFO L225 Difference]: With dead ends: 759 [2023-02-15 13:18:25,724 INFO L226 Difference]: Without dead ends: 759 [2023-02-15 13:18:25,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1809 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=1295, Invalid=5152, Unknown=45, NotChecked=480, Total=6972 [2023-02-15 13:18:25,726 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 850 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 166 mSolverCounterUnsat, 65 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 65 IncrementalHoareTripleChecker+Unknown, 867 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:18:25,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1421 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1652 Invalid, 65 Unknown, 867 Unchecked, 1.4s Time] [2023-02-15 13:18:25,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2023-02-15 13:18:25,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 341. [2023-02-15 13:18:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 320 states have (on average 1.25) internal successors, (400), 340 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:18:25,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 400 transitions. [2023-02-15 13:18:25,730 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 400 transitions. Word has length 36 [2023-02-15 13:18:25,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:18:25,730 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 400 transitions. [2023-02-15 13:18:25,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:18:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 400 transitions. [2023-02-15 13:18:25,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 13:18:25,757 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:18:25,757 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] [2023-02-15 13:18:25,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:18:25,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 13:18:25,958 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:18:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:18:25,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1501701986, now seen corresponding path program 1 times [2023-02-15 13:18:25,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:18:25,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373479581] [2023-02-15 13:18:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:18:25,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:18:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:18:26,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:18:26,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:18:26,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373479581] [2023-02-15 13:18:26,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373479581] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:18:26,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482854699] [2023-02-15 13:18:26,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:18:26,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:18:26,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:18:26,541 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) [2023-02-15 13:18:26,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 13:18:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:18:26,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-15 13:18:26,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:18:26,705 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:26,734 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:18:26,734 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:26,765 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:26,820 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:18:26,820 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:26,909 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2023-02-15 13:18:26,910 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:26,961 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 13:18:26,962 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 36 [2023-02-15 13:18:27,237 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:18:27,238 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 100 [2023-02-15 13:18:27,357 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:18:27,357 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 100 [2023-02-15 13:18:27,402 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:18:27,403 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 100 [2023-02-15 13:18:27,691 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:18:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:18:27,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:18:34,095 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1118 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17| 1) (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_17|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1118) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1))) is different from false [2023-02-15 13:18:34,106 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17| 1) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1112))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1118) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1))) is different from false [2023-02-15 13:18:34,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:18:34,206 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 42 [2023-02-15 13:18:34,210 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:18:34,213 INFO L350 Elim1Store]: Elim1 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 48 [2023-02-15 13:18:34,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2023-02-15 13:18:34,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2023-02-15 13:18:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:18:34,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482854699] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:18:34,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:18:34,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 36 [2023-02-15 13:18:34,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463424976] [2023-02-15 13:18:34,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:18:34,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-15 13:18:34,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:18:34,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-15 13:18:34,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=984, Unknown=36, NotChecked=134, Total=1332 [2023-02-15 13:18:34,392 INFO L87 Difference]: Start difference. First operand 341 states and 400 transitions. Second operand has 37 states, 36 states have (on average 2.638888888888889) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:18:48,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:19:04,531 WARN L233 SmtUtils]: Spent 16.15s on a formula simplification. DAG size of input: 58 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:19:06,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 13:19:12,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:19:14,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:19:16,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 13:19:23,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 13:19:25,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:19:27,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:19:29,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 13:19:31,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 13:19:33,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:19:35,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:19:37,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:19:39,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:19:41,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:19:43,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:19:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:48,793 INFO L93 Difference]: Finished difference Result 615 states and 703 transitions. [2023-02-15 13:19:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-02-15 13:19:48,793 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.638888888888889) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 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 [2023-02-15 13:19:48,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:48,794 INFO L225 Difference]: With dead ends: 615 [2023-02-15 13:19:48,794 INFO L226 Difference]: Without dead ends: 615 [2023-02-15 13:19:48,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 47.4s TimeCoverageRelationStatistics Valid=1071, Invalid=5054, Unknown=45, NotChecked=310, Total=6480 [2023-02-15 13:19:48,796 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 774 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 2400 mSolverCounterSat, 100 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 3140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2400 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 611 IncrementalHoareTripleChecker+Unchecked, 33.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:48,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1891 Invalid, 3140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2400 Invalid, 29 Unknown, 611 Unchecked, 33.9s Time] [2023-02-15 13:19:48,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2023-02-15 13:19:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 327. [2023-02-15 13:19:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 306 states have (on average 1.2450980392156863) internal successors, (381), 326 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:19:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 381 transitions. [2023-02-15 13:19:48,803 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 381 transitions. Word has length 38 [2023-02-15 13:19:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:48,804 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 381 transitions. [2023-02-15 13:19:48,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.638888888888889) internal successors, (95), 37 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:19:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 381 transitions. [2023-02-15 13:19:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 13:19:48,804 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:48,804 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] [2023-02-15 13:19:48,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 13:19:49,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:19:49,012 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:19:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:49,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1501701985, now seen corresponding path program 1 times [2023-02-15 13:19:49,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:49,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670825043] [2023-02-15 13:19:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:49,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:19:49,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:49,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670825043] [2023-02-15 13:19:49,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670825043] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:19:49,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752069131] [2023-02-15 13:19:49,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:49,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:19:49,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:19:49,800 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) [2023-02-15 13:19:49,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 13:19:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:49,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 67 conjunts are in the unsatisfiable core [2023-02-15 13:19:49,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:19:49,918 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:49,944 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:19:49,945 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:49,950 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:49,996 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:50,002 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:50,088 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:19:50,088 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:50,093 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:50,177 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-02-15 13:19:50,177 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:50,191 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:50,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:19:50,230 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:50,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:19:50,239 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:50,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:19:50,400 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:50,411 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:19:50,411 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:50,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:19:50,477 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:50,486 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:19:50,487 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:50,515 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:19:50,515 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:50,520 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:50,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:19:50,776 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:50,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:19:50,781 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 10 [2023-02-15 13:19:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:19:50,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:19:50,905 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_1245 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1245) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1245 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1245) |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_1246) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) is different from false [2023-02-15 13:19:50,933 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_1245 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1245) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1245 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1245) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1246) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) is different from false [2023-02-15 13:19:50,940 WARN L837 $PredicateComparison]: unable to prove that (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| 4))) (and (forall ((v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1245 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1245) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1246) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))) (forall ((v_ArrVal_1245 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1245) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) is different from false [2023-02-15 13:19:50,953 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (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|))) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_1245 (Array Int Int))) (<= 0 (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1245) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_1246 (Array Int Int)) (v_ArrVal_1245 (Array Int Int))) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1245) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (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_1246) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2023-02-15 13:19:54,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:54,974 INFO L350 Elim1Store]: Elim1 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 46 treesize of output 37 [2023-02-15 13:19:54,977 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:19:54,979 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 38 [2023-02-15 13:19:54,981 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:19:54,983 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:54,985 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:19:54,987 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 13 [2023-02-15 13:19:55,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:55,015 INFO L350 Elim1Store]: Elim1 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 96 treesize of output 87 [2023-02-15 13:19:55,018 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:19:55,019 INFO L350 Elim1Store]: Elim1 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 142 treesize of output 138 [2023-02-15 13:19:55,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:55,026 INFO L350 Elim1Store]: Elim1 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 130 treesize of output 100 [2023-02-15 13:19:55,031 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:19:55,033 INFO L350 Elim1Store]: Elim1 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 140 treesize of output 134 [2023-02-15 13:19:55,038 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:19:55,041 INFO L350 Elim1Store]: Elim1 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 48 [2023-02-15 13:19:55,045 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:19:55,046 INFO L350 Elim1Store]: Elim1 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 102 [2023-02-15 13:19:55,049 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:19:55,051 INFO L350 Elim1Store]: Elim1 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 59 treesize of output 47 [2023-02-15 13:19:55,054 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:19:55,055 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:19:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:19:57,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752069131] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:19:57,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:19:57,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 41 [2023-02-15 13:19:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259101216] [2023-02-15 13:19:57,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:19:57,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-15 13:19:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:57,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-15 13:19:57,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1227, Unknown=10, NotChecked=300, Total=1722 [2023-02-15 13:19:57,267 INFO L87 Difference]: Start difference. First operand 327 states and 381 transitions. Second operand has 42 states, 41 states have (on average 2.731707317073171) internal successors, (112), 42 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:00,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:20:05,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:05,915 INFO L93 Difference]: Finished difference Result 757 states and 862 transitions. [2023-02-15 13:20:05,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-02-15 13:20:05,915 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.731707317073171) internal successors, (112), 42 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-15 13:20:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:05,919 INFO L225 Difference]: With dead ends: 757 [2023-02-15 13:20:05,919 INFO L226 Difference]: Without dead ends: 757 [2023-02-15 13:20:05,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 1725 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=1175, Invalid=5602, Unknown=45, NotChecked=660, Total=7482 [2023-02-15 13:20:05,926 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 1424 mSDsluCounter, 2005 mSDsCounter, 0 mSdLazyCounter, 2594 mSolverCounterSat, 257 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 4097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 2594 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 1241 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:05,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 2126 Invalid, 4097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 2594 Invalid, 5 Unknown, 1241 Unchecked, 4.4s Time] [2023-02-15 13:20:05,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2023-02-15 13:20:05,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 327. [2023-02-15 13:20:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 306 states have (on average 1.2418300653594772) internal successors, (380), 326 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 380 transitions. [2023-02-15 13:20:05,964 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 380 transitions. Word has length 38 [2023-02-15 13:20:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:05,965 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 380 transitions. [2023-02-15 13:20:05,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.731707317073171) internal successors, (112), 42 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:05,967 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 380 transitions. [2023-02-15 13:20:05,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 13:20:05,967 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:05,967 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] [2023-02-15 13:20:05,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 13:20:06,168 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,SelfDestructingSolverStorable30 [2023-02-15 13:20:06,168 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:20:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:06,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1790052731, now seen corresponding path program 1 times [2023-02-15 13:20:06,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:06,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169799775] [2023-02-15 13:20:06,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:06,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:06,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:06,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169799775] [2023-02-15 13:20:06,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169799775] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:20:06,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513808729] [2023-02-15 13:20:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:06,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:06,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:06,337 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) [2023-02-15 13:20:06,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 13:20:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:06,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-15 13:20:06,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:06,649 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:06,650 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:06,653 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:06,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:06,654 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:06,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:20:06,841 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:06,842 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 45 [2023-02-15 13:20:06,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:06,850 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 41 [2023-02-15 13:20:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:07,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513808729] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:20:07,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:20:07,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2023-02-15 13:20:07,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582673005] [2023-02-15 13:20:07,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:20:07,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 13:20:07,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:07,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 13:20:07,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-02-15 13:20:07,020 INFO L87 Difference]: Start difference. First operand 327 states and 380 transitions. Second operand has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:07,783 INFO L93 Difference]: Finished difference Result 401 states and 453 transitions. [2023-02-15 13:20:07,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:20:07,783 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-15 13:20:07,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:07,784 INFO L225 Difference]: With dead ends: 401 [2023-02-15 13:20:07,784 INFO L226 Difference]: Without dead ends: 401 [2023-02-15 13:20:07,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2023-02-15 13:20:07,785 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 691 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 80 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:07,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 779 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 762 Invalid, 4 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:20:07,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2023-02-15 13:20:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 346. [2023-02-15 13:20:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 325 states have (on average 1.2461538461538462) internal successors, (405), 345 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 405 transitions. [2023-02-15 13:20:07,792 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 405 transitions. Word has length 38 [2023-02-15 13:20:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:07,792 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 405 transitions. [2023-02-15 13:20:07,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 405 transitions. [2023-02-15 13:20:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 13:20:07,793 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:07,793 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] [2023-02-15 13:20:07,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-15 13:20:07,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:07,998 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:20:07,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:07,998 INFO L85 PathProgramCache]: Analyzing trace with hash -434794642, now seen corresponding path program 1 times [2023-02-15 13:20:07,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:07,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948746624] [2023-02-15 13:20:07,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:07,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:08,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:08,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948746624] [2023-02-15 13:20:08,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948746624] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:20:08,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857775121] [2023-02-15 13:20:08,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:08,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:08,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:08,481 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) [2023-02-15 13:20:08,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 13:20:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:08,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 13:20:08,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:08,604 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:08,624 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:08,629 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:08,696 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:20:08,696 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:08,734 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 13:20:08,734 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:08,752 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-02-15 13:20:08,752 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:08,954 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:08,955 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:08,963 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:08,963 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:09,012 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:09,013 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:09,021 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:09,021 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:09,040 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:20:09,041 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:09,110 INFO L321 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2023-02-15 13:20:09,110 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:09,119 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:09,119 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:09,294 INFO L321 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2023-02-15 13:20:09,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 126 [2023-02-15 13:20:09,305 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:09,305 INFO L350 Elim1Store]: Elim1 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 103 treesize of output 103 [2023-02-15 13:20:09,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2023-02-15 13:20:09,421 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 13:20:09,426 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-15 13:20:09,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:09,497 INFO L350 Elim1Store]: Elim1 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 87 treesize of output 84 [2023-02-15 13:20:15,641 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 75 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:20:15,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:15,797 INFO L350 Elim1Store]: Elim1 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 82 treesize of output 76 [2023-02-15 13:20:16,037 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:16,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:16,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:20:16,294 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (or (forall ((v_ArrVal_1414 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) 1)) (forall ((v_ArrVal_1413 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1413) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1414 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse1) (= (select |c_#valid| .cse1) 1)))))) is different from false [2023-02-15 13:20:16,303 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (or (forall ((v_ArrVal_1413 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1413) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1414 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1414) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1414 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1414) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse2) (= 1 (select |c_#valid| .cse2))))))) is different from false [2023-02-15 13:20:16,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:16,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 151 [2023-02-15 13:20:17,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:17,121 INFO L350 Elim1Store]: Elim1 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 61 treesize of output 54 [2023-02-15 13:20:17,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:17,135 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 39 [2023-02-15 13:20:17,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:17,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 218 [2023-02-15 13:20:17,655 INFO L350 Elim1Store]: Elim1 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 21 [2023-02-15 13:20:17,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 13:20:17,732 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:17,755 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:17,768 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((v_arrayElimArr_11 (Array Int Int)) (v_subst_4 Int)) (let ((.cse0 (select v_arrayElimArr_11 (+ 4 v_subst_4)))) (or (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1411 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_arrayElimArr_11))) (or (= (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_1411) .cse0 v_ArrVal_1413) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (store .cse2 .cse0 v_prenex_16) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~malloc7#1.base|) (= |c_ULTIMATE.start_main_#t~malloc7#1.base| (select (select (store .cse2 .cse0 v_ArrVal_1414) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_arrayElimArr_10 (Array Int Int)) (v_prenex_43 (Array Int Int)) (v_subst_3 Int) (v_prenex_44 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_arrayElimArr_10)) (.cse5 (select v_arrayElimArr_10 (+ 4 v_subst_3)))) (let ((.cse6 (select (select (store .cse4 .cse5 v_prenex_44) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_#t~malloc7#1.base| (select (select (store .cse4 .cse5 v_prenex_43) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (= .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) (= .cse6 |c_ULTIMATE.start_main_#t~malloc7#1.base|))))))) is different from false [2023-02-15 13:20:18,546 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-02-15 13:20:18,546 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 45 [2023-02-15 13:20:18,549 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:18,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:18,556 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 45 [2023-02-15 13:20:18,571 INFO L321 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2023-02-15 13:20:18,571 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 38 [2023-02-15 13:20:18,574 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:18,580 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:20:18,580 INFO L350 Elim1Store]: Elim1 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 89 treesize of output 53 [2023-02-15 13:20:18,586 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:18,591 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:18,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 13:20:18,597 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:18,600 INFO L321 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2023-02-15 13:20:18,600 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 1 [2023-02-15 13:20:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:18,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857775121] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:20:18,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:20:18,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 19] total 49 [2023-02-15 13:20:18,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87333131] [2023-02-15 13:20:18,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:20:18,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-15 13:20:18,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:18,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-15 13:20:18,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1953, Unknown=31, NotChecked=276, Total=2450 [2023-02-15 13:20:18,683 INFO L87 Difference]: Start difference. First operand 346 states and 405 transitions. Second operand has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 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) [2023-02-15 13:20:23,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:23,913 INFO L93 Difference]: Finished difference Result 550 states and 625 transitions. [2023-02-15 13:20:23,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-15 13:20:23,914 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 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 [2023-02-15 13:20:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:23,915 INFO L225 Difference]: With dead ends: 550 [2023-02-15 13:20:23,915 INFO L226 Difference]: Without dead ends: 550 [2023-02-15 13:20:23,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1517 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1125, Invalid=5996, Unknown=31, NotChecked=504, Total=7656 [2023-02-15 13:20:23,917 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 762 mSDsluCounter, 2126 mSDsCounter, 0 mSdLazyCounter, 3113 mSolverCounterSat, 169 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 3963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 3113 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 677 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:23,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 2227 Invalid, 3963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 3113 Invalid, 4 Unknown, 677 Unchecked, 2.6s Time] [2023-02-15 13:20:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2023-02-15 13:20:23,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 360. [2023-02-15 13:20:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.2418879056047198) internal successors, (421), 359 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 421 transitions. [2023-02-15 13:20:23,926 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 421 transitions. Word has length 38 [2023-02-15 13:20:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:23,926 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 421 transitions. [2023-02-15 13:20:23,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 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) [2023-02-15 13:20:23,927 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 421 transitions. [2023-02-15 13:20:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:20:23,927 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:23,927 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] [2023-02-15 13:20:23,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 13:20:24,129 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,SelfDestructingSolverStorable32 [2023-02-15 13:20:24,130 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:20:24,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:24,130 INFO L85 PathProgramCache]: Analyzing trace with hash 342939421, now seen corresponding path program 1 times [2023-02-15 13:20:24,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:24,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841374912] [2023-02-15 13:20:24,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:24,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:20:24,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:24,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841374912] [2023-02-15 13:20:24,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841374912] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:20:24,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493445277] [2023-02-15 13:20:24,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:24,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:24,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:24,197 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) [2023-02-15 13:20:24,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 13:20:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:24,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 13:20:24,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:24,353 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:20:24,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:20:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:20:24,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493445277] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:20:24,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:20:24,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-15 13:20:24,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076291614] [2023-02-15 13:20:24,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:20:24,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:20:24,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:24,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:20:24,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:20:24,392 INFO L87 Difference]: Start difference. First operand 360 states and 421 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:24,495 INFO L93 Difference]: Finished difference Result 366 states and 426 transitions. [2023-02-15 13:20:24,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:20:24,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 [2023-02-15 13:20:24,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:24,496 INFO L225 Difference]: With dead ends: 366 [2023-02-15 13:20:24,496 INFO L226 Difference]: Without dead ends: 331 [2023-02-15 13:20:24,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:20:24,497 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 31 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:24,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 232 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:20:24,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-02-15 13:20:24,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2023-02-15 13:20:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 310 states have (on average 1.2548387096774194) internal successors, (389), 330 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 389 transitions. [2023-02-15 13:20:24,500 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 389 transitions. Word has length 39 [2023-02-15 13:20:24,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:24,500 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 389 transitions. [2023-02-15 13:20:24,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:24,501 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 389 transitions. [2023-02-15 13:20:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:20:24,501 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:24,501 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] [2023-02-15 13:20:24,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 13:20:24,706 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,SelfDestructingSolverStorable33 [2023-02-15 13:20:24,706 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:20:24,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:24,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1235381073, now seen corresponding path program 1 times [2023-02-15 13:20:24,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:24,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504307710] [2023-02-15 13:20:24,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:24,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:25,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:25,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504307710] [2023-02-15 13:20:25,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504307710] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:20:25,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288582453] [2023-02-15 13:20:25,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:25,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:25,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:25,221 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) [2023-02-15 13:20:25,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 13:20:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:25,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 13:20:25,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:25,345 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,354 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,362 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:20:25,362 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,370 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,374 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,386 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,397 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,451 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:20:25,451 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,478 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:25,483 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,509 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,548 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,562 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,571 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,608 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:25,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:20:25,623 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1582 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1582) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 2)) is different from false [2023-02-15 13:20:25,634 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1582 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1582) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) is different from false [2023-02-15 13:20:25,637 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1582 (Array Int Int))) (= (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_1582) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 2)) is different from false [2023-02-15 13:20:25,703 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_28| Int) (v_ArrVal_1582 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int) (v_ArrVal_1579 Int)) (or (= 2 (select (select (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|) |v_ULTIMATE.start_main_~x~0#1.offset_98| v_ArrVal_1579)) |v_ULTIMATE.start_main_#t~malloc7#1.base_28| v_ArrVal_1582) |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_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_28|) 0)))) is different from false [2023-02-15 13:20:25,721 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1575 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_28| Int) (v_ArrVal_1582 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int) (v_ArrVal_1579 Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1575))) (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_98| v_ArrVal_1579))) |v_ULTIMATE.start_main_#t~malloc7#1.base_28| v_ArrVal_1582) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 2) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_28|) 0)))) is different from false [2023-02-15 13:20:25,773 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:20:25,774 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:25,928 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 47 [2023-02-15 13:20:25,931 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:25,933 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 38 [2023-02-15 13:20:25,936 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:25,937 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 13 [2023-02-15 13:20:25,939 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:25,940 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:25,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288582453] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:20:25,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:20:25,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 35 [2023-02-15 13:20:25,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112374610] [2023-02-15 13:20:25,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:20:25,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 13:20:25,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:25,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 13:20:25,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=733, Unknown=18, NotChecked=300, Total=1190 [2023-02-15 13:20:25,975 INFO L87 Difference]: Start difference. First operand 331 states and 389 transitions. Second operand has 35 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:27,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:27,573 INFO L93 Difference]: Finished difference Result 485 states and 560 transitions. [2023-02-15 13:20:27,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-15 13:20:27,573 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 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 [2023-02-15 13:20:27,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:27,574 INFO L225 Difference]: With dead ends: 485 [2023-02-15 13:20:27,574 INFO L226 Difference]: Without dead ends: 485 [2023-02-15 13:20:27,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=629, Invalid=2667, Unknown=30, NotChecked=580, Total=3906 [2023-02-15 13:20:27,576 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 535 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 78 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 2503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 886 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:27,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1218 Invalid, 2503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1517 Invalid, 22 Unknown, 886 Unchecked, 0.8s Time] [2023-02-15 13:20:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2023-02-15 13:20:27,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 352. [2023-02-15 13:20:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 331 states have (on average 1.2507552870090635) internal successors, (414), 351 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 414 transitions. [2023-02-15 13:20:27,581 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 414 transitions. Word has length 40 [2023-02-15 13:20:27,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:27,582 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 414 transitions. [2023-02-15 13:20:27,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 414 transitions. [2023-02-15 13:20:27,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:20:27,583 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:27,583 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] [2023-02-15 13:20:27,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 13:20:27,788 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,SelfDestructingSolverStorable34 [2023-02-15 13:20:27,789 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:20:27,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1860360063, now seen corresponding path program 1 times [2023-02-15 13:20:27,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:27,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368644501] [2023-02-15 13:20:27,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:28,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:28,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368644501] [2023-02-15 13:20:28,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368644501] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:20:28,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832441160] [2023-02-15 13:20:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:28,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:28,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:28,541 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) [2023-02-15 13:20:28,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 13:20:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:28,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-15 13:20:28,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:28,672 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:28,709 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:28,712 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:28,785 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:20:28,785 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:28,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:28,814 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:28,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:28,819 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:28,946 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:28,946 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:28,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:28,950 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:28,986 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:28,987 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:28,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:28,991 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:29,008 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:20:29,008 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:29,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:29,063 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-15 13:20:29,063 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:29,067 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:29,186 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 13:20:29,187 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:29,190 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:29,194 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:29,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:29,331 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:29,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:29,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:29,335 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:29,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:20:29,401 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_1708 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1708) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1707 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-02-15 13:20:29,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:29,574 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:29,764 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:29,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 98 [2023-02-15 13:20:29,776 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:29,810 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:29,833 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_19| Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1706 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc10#1.base_19| |c_ULTIMATE.start_main_~x~0#1.base|) (= (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_1706) |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1708) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_subst_5 Int) (v_ArrVal_1707 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_16 (+ 4 v_subst_5)))) (or (= (select (select (store (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_arrayElimArr_16) .cse1 v_ArrVal_1707) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_~x~0#1.base|)))))) is different from false [2023-02-15 13:20:32,396 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:32,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:32,402 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 34 [2023-02-15 13:20:32,405 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:32,406 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:32,407 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 28 [2023-02-15 13:20:32,410 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:32,415 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:32,415 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:32,417 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:20:32,418 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 1 [2023-02-15 13:20:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:32,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832441160] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:20:32,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:20:32,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 43 [2023-02-15 13:20:32,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845101609] [2023-02-15 13:20:32,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:20:32,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-15 13:20:32,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:32,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-15 13:20:32,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1388, Unknown=29, NotChecked=158, Total=1806 [2023-02-15 13:20:32,485 INFO L87 Difference]: Start difference. First operand 352 states and 414 transitions. Second operand has 43 states, 43 states have (on average 2.627906976744186) internal successors, (113), 43 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:34,616 INFO L93 Difference]: Finished difference Result 505 states and 584 transitions. [2023-02-15 13:20:34,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 13:20:34,616 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.627906976744186) internal successors, (113), 43 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-15 13:20:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:34,617 INFO L225 Difference]: With dead ends: 505 [2023-02-15 13:20:34,617 INFO L226 Difference]: Without dead ends: 505 [2023-02-15 13:20:34,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=686, Invalid=3199, Unknown=29, NotChecked=246, Total=4160 [2023-02-15 13:20:34,618 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 630 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 417 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:34,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 1331 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1618 Invalid, 0 Unknown, 417 Unchecked, 1.1s Time] [2023-02-15 13:20:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2023-02-15 13:20:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 347. [2023-02-15 13:20:34,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 326 states have (on average 1.2515337423312884) internal successors, (408), 346 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 408 transitions. [2023-02-15 13:20:34,622 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 408 transitions. Word has length 40 [2023-02-15 13:20:34,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:34,622 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 408 transitions. [2023-02-15 13:20:34,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.627906976744186) internal successors, (113), 43 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 408 transitions. [2023-02-15 13:20:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:20:34,627 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:34,627 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:34,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 13:20:34,832 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,SelfDestructingSolverStorable35 [2023-02-15 13:20:34,833 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:20:34,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:34,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1671753086, now seen corresponding path program 1 times [2023-02-15 13:20:34,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:34,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78124209] [2023-02-15 13:20:34,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:34,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:35,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:35,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:35,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78124209] [2023-02-15 13:20:35,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78124209] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:20:35,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482559373] [2023-02-15 13:20:35,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:35,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:35,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:35,087 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) [2023-02-15 13:20:35,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 13:20:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:35,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 13:20:35,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:35,254 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:35,315 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:20:35,315 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:35,344 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:35,432 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:35,432 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:35,465 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:35,465 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:35,480 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:35,480 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:35,593 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:35,593 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 13 [2023-02-15 13:20:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:35,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:20:37,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:37,937 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 21 [2023-02-15 13:20:37,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:37,945 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 37 [2023-02-15 13:20:37,952 INFO L350 Elim1Store]: Elim1 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 9 [2023-02-15 13:20:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:42,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482559373] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:20:42,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:20:42,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2023-02-15 13:20:42,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487725021] [2023-02-15 13:20:42,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:20:42,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 13:20:42,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:42,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 13:20:42,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=735, Unknown=6, NotChecked=0, Total=870 [2023-02-15 13:20:42,293 INFO L87 Difference]: Start difference. First operand 347 states and 408 transitions. Second operand has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 30 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:43,500 INFO L93 Difference]: Finished difference Result 620 states and 714 transitions. [2023-02-15 13:20:43,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 13:20:43,501 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 30 states have internal predecessors, (115), 0 states have call successors, (0), 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 [2023-02-15 13:20:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:43,502 INFO L225 Difference]: With dead ends: 620 [2023-02-15 13:20:43,502 INFO L226 Difference]: Without dead ends: 620 [2023-02-15 13:20:43,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=279, Invalid=1197, Unknown=6, NotChecked=0, Total=1482 [2023-02-15 13:20:43,503 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 673 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:43,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1051 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 13:20:43,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2023-02-15 13:20:43,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 408. [2023-02-15 13:20:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 387 states have (on average 1.2403100775193798) internal successors, (480), 407 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 480 transitions. [2023-02-15 13:20:43,508 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 480 transitions. Word has length 40 [2023-02-15 13:20:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:43,508 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 480 transitions. [2023-02-15 13:20:43,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 30 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 480 transitions. [2023-02-15 13:20:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:20:43,508 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:43,508 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:43,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 13:20:43,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:43,714 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:20:43,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:43,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1671753085, now seen corresponding path program 1 times [2023-02-15 13:20:43,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:43,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53169108] [2023-02-15 13:20:43,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:43,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:44,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:44,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53169108] [2023-02-15 13:20:44,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53169108] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:20:44,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596083138] [2023-02-15 13:20:44,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:44,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:44,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:44,003 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) [2023-02-15 13:20:44,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 13:20:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:44,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 13:20:44,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:44,139 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:44,202 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:20:44,202 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:44,209 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:44,242 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:44,248 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:44,346 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:44,346 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:44,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:44,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:20:44,387 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:20:44,387 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:44,390 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:44,400 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:44,400 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:44,430 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:44,430 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:44,432 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:44,553 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:44,554 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:44,557 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:44,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:44,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2023-02-15 13:20:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:44,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:20:45,119 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:45,120 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 38 [2023-02-15 13:20:45,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:45,124 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 30 [2023-02-15 13:20:45,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:45,132 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 55 [2023-02-15 13:20:45,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:45,141 INFO L350 Elim1Store]: Elim1 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 82 treesize of output 81 [2023-02-15 13:20:45,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2023-02-15 13:20:45,148 INFO L350 Elim1Store]: Elim1 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 28 [2023-02-15 13:20:45,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:45,217 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 21 [2023-02-15 13:20:45,219 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:45,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:45,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:45,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-02-15 13:20:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:45,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596083138] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:20:45,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:20:45,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2023-02-15 13:20:45,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825733491] [2023-02-15 13:20:45,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:20:45,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 13:20:45,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:45,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 13:20:45,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=892, Unknown=4, NotChecked=0, Total=992 [2023-02-15 13:20:45,442 INFO L87 Difference]: Start difference. First operand 408 states and 480 transitions. Second operand has 32 states, 31 states have (on average 3.806451612903226) internal successors, (118), 32 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:47,113 INFO L93 Difference]: Finished difference Result 553 states and 630 transitions. [2023-02-15 13:20:47,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 13:20:47,113 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.806451612903226) internal successors, (118), 32 states have internal predecessors, (118), 0 states have call successors, (0), 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 [2023-02-15 13:20:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:47,114 INFO L225 Difference]: With dead ends: 553 [2023-02-15 13:20:47,114 INFO L226 Difference]: Without dead ends: 553 [2023-02-15 13:20:47,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=378, Invalid=2068, Unknown=4, NotChecked=0, Total=2450 [2023-02-15 13:20:47,115 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 743 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:47,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1299 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 13:20:47,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2023-02-15 13:20:47,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 433. [2023-02-15 13:20:47,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 412 states have (on average 1.2378640776699028) internal successors, (510), 432 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 510 transitions. [2023-02-15 13:20:47,120 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 510 transitions. Word has length 40 [2023-02-15 13:20:47,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:47,120 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 510 transitions. [2023-02-15 13:20:47,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.806451612903226) internal successors, (118), 32 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:47,120 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 510 transitions. [2023-02-15 13:20:47,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 13:20:47,121 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:47,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 13:20:47,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-02-15 13:20:47,327 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:20:47,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:47,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1015163354, now seen corresponding path program 1 times [2023-02-15 13:20:47,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:47,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786700849] [2023-02-15 13:20:47,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:47,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:47,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:47,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:47,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786700849] [2023-02-15 13:20:47,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786700849] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:20:47,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:20:47,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:20:47,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025794183] [2023-02-15 13:20:47,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:20:47,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:20:47,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:47,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:20:47,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:20:47,505 INFO L87 Difference]: Start difference. First operand 433 states and 510 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:47,795 INFO L93 Difference]: Finished difference Result 458 states and 534 transitions. [2023-02-15 13:20:47,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:20:47,795 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-02-15 13:20:47,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:47,796 INFO L225 Difference]: With dead ends: 458 [2023-02-15 13:20:47,796 INFO L226 Difference]: Without dead ends: 453 [2023-02-15 13:20:47,797 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 [2023-02-15 13:20:47,797 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 296 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:47,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 347 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:20:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2023-02-15 13:20:47,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 429. [2023-02-15 13:20:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 408 states have (on average 1.2377450980392157) internal successors, (505), 428 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 505 transitions. [2023-02-15 13:20:47,801 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 505 transitions. Word has length 41 [2023-02-15 13:20:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:47,802 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 505 transitions. [2023-02-15 13:20:47,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 505 transitions. [2023-02-15 13:20:47,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 13:20:47,802 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:47,802 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] [2023-02-15 13:20:47,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-02-15 13:20:47,803 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:20:47,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:47,803 INFO L85 PathProgramCache]: Analyzing trace with hash 545888581, now seen corresponding path program 1 times [2023-02-15 13:20:47,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:47,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539482140] [2023-02-15 13:20:47,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:47,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:48,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:48,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539482140] [2023-02-15 13:20:48,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539482140] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:20:48,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368728462] [2023-02-15 13:20:48,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:48,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:48,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:48,017 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:20:48,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 13:20:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:48,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 13:20:48,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:48,157 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:48,177 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:20:48,178 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:48,183 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:48,187 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:48,201 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:48,208 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:48,324 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:48,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:20:48,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:20:48,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368728462] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:20:48,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:20:48,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 13 [2023-02-15 13:20:48,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901114523] [2023-02-15 13:20:48,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:20:48,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:20:48,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:48,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:20:48,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:20:48,327 INFO L87 Difference]: Start difference. First operand 429 states and 505 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) 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) [2023-02-15 13:20:48,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:48,633 INFO L93 Difference]: Finished difference Result 453 states and 529 transitions. [2023-02-15 13:20:48,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:20:48,634 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) 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 [2023-02-15 13:20:48,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:48,635 INFO L225 Difference]: With dead ends: 453 [2023-02-15 13:20:48,635 INFO L226 Difference]: Without dead ends: 453 [2023-02-15 13:20:48,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2023-02-15 13:20:48,635 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 225 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:48,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 398 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:20:48,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2023-02-15 13:20:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 437. [2023-02-15 13:20:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 416 states have (on average 1.2355769230769231) internal successors, (514), 436 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 514 transitions. [2023-02-15 13:20:48,641 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 514 transitions. Word has length 42 [2023-02-15 13:20:48,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:48,642 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 514 transitions. [2023-02-15 13:20:48,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) 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) [2023-02-15 13:20:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 514 transitions. [2023-02-15 13:20:48,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 13:20:48,642 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:48,642 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] [2023-02-15 13:20:48,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-15 13:20:48,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-02-15 13:20:48,849 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:20:48,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:48,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1248860378, now seen corresponding path program 1 times [2023-02-15 13:20:48,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:48,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887236354] [2023-02-15 13:20:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:48,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:49,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:49,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887236354] [2023-02-15 13:20:49,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887236354] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:20:49,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297041827] [2023-02-15 13:20:49,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:49,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:49,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:49,371 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:20:49,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-15 13:20:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:49,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-15 13:20:49,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:49,524 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:49,576 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:20:49,576 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:49,607 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:49,662 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:49,663 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:49,733 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2023-02-15 13:20:49,733 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:49,781 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 13:20:49,781 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 36 [2023-02-15 13:20:50,032 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:50,032 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 84 [2023-02-15 13:20:50,098 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:50,098 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 84 [2023-02-15 13:20:50,152 INFO L321 Elim1Store]: treesize reduction 86, result has 41.9 percent of original size [2023-02-15 13:20:50,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 108 treesize of output 154 [2023-02-15 13:20:50,376 INFO L321 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2023-02-15 13:20:50,376 INFO L350 Elim1Store]: Elim1 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 119 treesize of output 77 [2023-02-15 13:20:50,637 INFO L321 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2023-02-15 13:20:50,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 228 treesize of output 194 [2023-02-15 13:20:50,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:50,779 INFO L350 Elim1Store]: Elim1 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 142 treesize of output 131 [2023-02-15 13:20:50,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2023-02-15 13:20:50,896 INFO L350 Elim1Store]: Elim1 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 142 treesize of output 138 [2023-02-15 13:20:59,189 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 96 DAG size of output: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:20:59,366 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:20:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:59,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:20:59,434 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2141 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2141) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1)) is different from false [2023-02-15 13:21:01,585 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:21:01,585 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 29 [2023-02-15 13:21:02,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:21:02,267 INFO L350 Elim1Store]: Elim1 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 56 [2023-02-15 13:21:02,270 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:21:02,270 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:21:02,273 INFO L350 Elim1Store]: Elim1 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 66 treesize of output 62 [2023-02-15 13:21:02,276 INFO L350 Elim1Store]: Elim1 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 83 treesize of output 67 [2023-02-15 13:21:02,282 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 40 [2023-02-15 13:21:02,287 INFO L350 Elim1Store]: Elim1 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 46 [2023-02-15 13:21:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:21:02,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297041827] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:21:02,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:21:02,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 18] total 45 [2023-02-15 13:21:02,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531996661] [2023-02-15 13:21:02,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:21:02,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 13:21:02,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:21:02,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 13:21:02,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1717, Unknown=14, NotChecked=86, Total=2070 [2023-02-15 13:21:02,595 INFO L87 Difference]: Start difference. First operand 437 states and 514 transitions. Second operand has 46 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 46 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) [2023-02-15 13:21:12,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:21:15,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:21:17,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:21:22,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:21:24,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:21:27,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:21:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:21:32,193 INFO L93 Difference]: Finished difference Result 810 states and 940 transitions. [2023-02-15 13:21:32,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-02-15 13:21:32,193 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 46 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 [2023-02-15 13:21:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:21:32,195 INFO L225 Difference]: With dead ends: 810 [2023-02-15 13:21:32,195 INFO L226 Difference]: Without dead ends: 810 [2023-02-15 13:21:32,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4159 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=1955, Invalid=11558, Unknown=63, NotChecked=230, Total=13806 [2023-02-15 13:21:32,196 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 1019 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 3429 mSolverCounterSat, 198 mSolverCounterUnsat, 52 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 2544 SdHoareTripleChecker+Invalid, 3964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 3429 IncrementalHoareTripleChecker+Invalid, 52 IncrementalHoareTripleChecker+Unknown, 285 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:21:32,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 2544 Invalid, 3964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 3429 Invalid, 52 Unknown, 285 Unchecked, 16.3s Time] [2023-02-15 13:21:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2023-02-15 13:21:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 485. [2023-02-15 13:21:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 464 states have (on average 1.228448275862069) internal successors, (570), 484 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:21:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 570 transitions. [2023-02-15 13:21:32,201 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 570 transitions. Word has length 42 [2023-02-15 13:21:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:21:32,202 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 570 transitions. [2023-02-15 13:21:32,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.3555555555555556) internal successors, (106), 46 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) [2023-02-15 13:21:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 570 transitions. [2023-02-15 13:21:32,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 13:21:32,202 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:21:32,202 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] [2023-02-15 13:21:32,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-02-15 13:21:32,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:21:32,414 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 13:21:32,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:21:32,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1248860377, now seen corresponding path program 1 times [2023-02-15 13:21:32,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:21:32,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455089862] [2023-02-15 13:21:32,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:21:32,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:21:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:21:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:21:33,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:21:33,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455089862] [2023-02-15 13:21:33,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455089862] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:21:33,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005653956] [2023-02-15 13:21:33,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:21:33,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:21:33,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:21:33,389 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:21:33,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 13:21:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:21:33,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 82 conjunts are in the unsatisfiable core [2023-02-15 13:21:33,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:21:33,550 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:33,592 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:21:33,593 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:33,602 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:33,643 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:33,651 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:33,756 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:21:33,756 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:33,770 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:33,842 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-02-15 13:21:33,842 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:33,854 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:33,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:21:33,890 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:33,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:21:33,898 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:34,073 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:21:34,073 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:34,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:21:34,085 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:34,161 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:21:34,161 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:34,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:21:34,170 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:34,203 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:21:34,204 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:34,231 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-02-15 13:21:34,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:21:34,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:21:34,319 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-15 13:21:34,319 INFO L350 Elim1Store]: Elim1 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 64 treesize of output 46 [2023-02-15 13:21:34,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 13:21:34,500 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 13:21:34,500 INFO L350 Elim1Store]: Elim1 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 105 treesize of output 92 [2023-02-15 13:21:34,508 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:34,513 INFO L350 Elim1Store]: Elim1 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 17 [2023-02-15 13:21:35,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:21:35,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 133 [2023-02-15 13:21:35,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:21:35,211 INFO L350 Elim1Store]: Elim1 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 68 treesize of output 76 [2023-02-15 13:21:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:21:35,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:21:35,494 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_2289 (Array Int Int)) (v_ArrVal_2288 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2288) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2289) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_2288 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2288) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2023-02-15 13:21:35,502 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_2288 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2288) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_2289 (Array Int Int)) (v_ArrVal_2288 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2288) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2289) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2023-02-15 13:21:35,514 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_2288 (Array Int Int)) (v_ArrVal_2286 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2286) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_2288) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_2289 (Array Int Int)) (v_ArrVal_2288 (Array Int Int)) (v_ArrVal_2286 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2286) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_2288) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (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| 4) |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_2289) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) is different from false [2023-02-15 13:21:35,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:21:35,584 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 43 [2023-02-15 13:21:35,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:21:35,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 133 [2023-02-15 13:21:35,928 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-15 13:21:35,932 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:35,937 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 13:21:35,945 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (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|))) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_arrayElimArr_25 (Array Int Int)) (v_subst_8 Int)) (let ((.cse0 (select v_arrayElimArr_25 (+ 4 v_subst_8)))) (or (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_2289 (Array Int Int)) (v_ArrVal_2288 (Array Int Int)) (v_ArrVal_2286 (Array Int Int))) (<= (+ (select (select (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2286) .cse0 v_ArrVal_2288) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select (store |c_#length| .cse0 12) (select (select (store (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_arrayElimArr_25) .cse0 v_ArrVal_2289) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) (forall ((v_prenex_87 (Array Int Int)) (v_prenex_86 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_27| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc10#1.base_27| |c_ULTIMATE.start_main_~x~0#1.base|) (<= 0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_prenex_87) |v_ULTIMATE.start_main_#t~malloc10#1.base_27| v_prenex_86) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) is different from false