./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/dancing.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 c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:58:49,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:58:49,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:58:49,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:58:49,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:58:49,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:58:49,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:58:49,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:58:49,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:58:49,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:58:49,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:58:49,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:58:49,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:58:49,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:58:49,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:58:49,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:58:49,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:58:49,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:58:49,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:58:49,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:58:49,929 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:58:49,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:58:49,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:58:49,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:58:49,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:58:49,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:58:49,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:58:49,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:58:49,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:58:49,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:58:49,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:58:49,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:58:49,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:58:49,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:58:49,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:58:49,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:58:49,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:58:49,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:58:49,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:58:49,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:58:49,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:58:49,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:58:49,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:58:49,963 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:58:49,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:58:49,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:58:49,964 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:58:49,964 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:58:49,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:58:49,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:58:49,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:58:49,965 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:58:49,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:58:49,966 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:58:49,966 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:58:49,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:58:49,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:58:49,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:58:49,967 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:58:49,967 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:58:49,967 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:58:49,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:58:49,967 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:58:49,968 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:58:49,968 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:58:49,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:58:49,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:58:49,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:58:49,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:58:49,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:58:49,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:58:49,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:58:49,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:58:49,970 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2022-07-12 18:58:50,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:58:50,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:58:50,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:58:50,239 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:58:50,240 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:58:50,241 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-12 18:58:50,303 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc04df358/87db7f14458644f6a506332ae1c3f640/FLAGdab9a4e32 [2022-07-12 18:58:50,766 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:58:50,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-12 18:58:50,788 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc04df358/87db7f14458644f6a506332ae1c3f640/FLAGdab9a4e32 [2022-07-12 18:58:51,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc04df358/87db7f14458644f6a506332ae1c3f640 [2022-07-12 18:58:51,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:58:51,137 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:58:51,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:58:51,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:58:51,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:58:51,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:58:51" (1/1) ... [2022-07-12 18:58:51,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f6caa5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:58:51, skipping insertion in model container [2022-07-12 18:58:51,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:58:51" (1/1) ... [2022-07-12 18:58:51,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:58:51,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:58:51,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-07-12 18:58:51,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:58:51,588 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:58:51,601 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-07-12 18:58:51,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:58:51,667 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:58:51,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:58:51 WrapperNode [2022-07-12 18:58:51,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:58:51,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:58:51,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:58:51,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:58:51,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:58:51" (1/1) ... [2022-07-12 18:58:51,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:58:51" (1/1) ... [2022-07-12 18:58:51,730 INFO L137 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2022-07-12 18:58:51,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:58:51,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:58:51,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:58:51,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:58:51,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:58:51" (1/1) ... [2022-07-12 18:58:51,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:58:51" (1/1) ... [2022-07-12 18:58:51,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:58:51" (1/1) ... [2022-07-12 18:58:51,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:58:51" (1/1) ... [2022-07-12 18:58:51,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:58:51" (1/1) ... [2022-07-12 18:58:51,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:58:51" (1/1) ... [2022-07-12 18:58:51,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:58:51" (1/1) ... [2022-07-12 18:58:51,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:58:51,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:58:51,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:58:51,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:58:51,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:58:51" (1/1) ... [2022-07-12 18:58:51,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:58:51,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:58:51,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 18:58:51,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 18:58:51,856 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-07-12 18:58:51,856 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-07-12 18:58:51,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 18:58:51,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 18:58:51,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:58:51,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:58:51,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 18:58:51,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:58:51,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:58:51,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:58:51,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:58:51,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:58:51,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:58:51,980 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:58:51,982 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:58:52,310 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:58:52,323 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:58:52,323 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 18:58:52,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:58:52 BoogieIcfgContainer [2022-07-12 18:58:52,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:58:52,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:58:52,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:58:52,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:58:52,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:58:51" (1/3) ... [2022-07-12 18:58:52,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6800f6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:58:52, skipping insertion in model container [2022-07-12 18:58:52,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:58:51" (2/3) ... [2022-07-12 18:58:52,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6800f6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:58:52, skipping insertion in model container [2022-07-12 18:58:52,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:58:52" (3/3) ... [2022-07-12 18:58:52,334 INFO L111 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-07-12 18:58:52,348 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:58:52,349 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2022-07-12 18:58:52,401 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:58:52,408 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@275fdb1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74f2685f [2022-07-12 18:58:52,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2022-07-12 18:58:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 55 states have (on average 2.036363636363636) internal successors, (112), 99 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 18:58:52,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:58:52,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:52,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:58:52,436 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:58:52,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:52,443 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 18:58:52,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:58:52,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858348148] [2022-07-12 18:58:52,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:58:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:52,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:58:52,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858348148] [2022-07-12 18:58:52,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858348148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:58:52,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:58:52,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:58:52,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893541665] [2022-07-12 18:58:52,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:58:52,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:58:52,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:58:52,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:58:52,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:58:52,646 INFO L87 Difference]: Start difference. First operand has 108 states, 55 states have (on average 2.036363636363636) internal successors, (112), 99 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:58:52,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:52,772 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-07-12 18:58:52,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:58:52,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-12 18:58:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:52,780 INFO L225 Difference]: With dead ends: 106 [2022-07-12 18:58:52,780 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 18:58:52,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:58:52,785 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 82 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:52,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 94 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:58:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 18:58:52,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-12 18:58:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 95 states have internal predecessors, (105), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 18:58:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2022-07-12 18:58:52,835 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 3 [2022-07-12 18:58:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:52,836 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2022-07-12 18:58:52,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:58:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-07-12 18:58:52,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:58:52,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:52,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:58:52,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:58:52,838 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:58:52,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:52,839 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 18:58:52,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:58:52,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859748112] [2022-07-12 18:58:52,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:52,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:58:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:52,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:58:52,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859748112] [2022-07-12 18:58:52,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859748112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:58:52,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:58:52,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:58:52,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311979486] [2022-07-12 18:58:52,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:58:52,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:58:52,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:58:52,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:58:52,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:58:52,906 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:58:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:53,001 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-07-12 18:58:53,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:58:53,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-12 18:58:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:53,003 INFO L225 Difference]: With dead ends: 102 [2022-07-12 18:58:53,003 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 18:58:53,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:58:53,004 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:53,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 92 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:58:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 18:58:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-12 18:58:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 93 states have internal predecessors, (103), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 18:58:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2022-07-12 18:58:53,012 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 3 [2022-07-12 18:58:53,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:53,013 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2022-07-12 18:58:53,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:58:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2022-07-12 18:58:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:58:53,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:53,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:58:53,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:58:53,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:58:53,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:53,015 INFO L85 PathProgramCache]: Analyzing trace with hash 59267633, now seen corresponding path program 1 times [2022-07-12 18:58:53,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:58:53,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706478589] [2022-07-12 18:58:53,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:53,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:58:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:53,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:58:53,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706478589] [2022-07-12 18:58:53,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706478589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:58:53,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:58:53,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:58:53,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796810563] [2022-07-12 18:58:53,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:58:53,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:58:53,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:58:53,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:58:53,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:58:53,075 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:58:53,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:53,180 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2022-07-12 18:58:53,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:58:53,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 18:58:53,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:53,181 INFO L225 Difference]: With dead ends: 165 [2022-07-12 18:58:53,181 INFO L226 Difference]: Without dead ends: 165 [2022-07-12 18:58:53,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:58:53,183 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 74 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:53,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 213 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:58:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-12 18:58:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 100. [2022-07-12 18:58:53,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 91 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 18:58:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-07-12 18:58:53,201 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 8 [2022-07-12 18:58:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:53,202 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-07-12 18:58:53,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:58:53,202 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2022-07-12 18:58:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:58:53,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:53,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:58:53,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:58:53,203 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:58:53,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash 59267634, now seen corresponding path program 1 times [2022-07-12 18:58:53,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:58:53,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397572470] [2022-07-12 18:58:53,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:53,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:58:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:53,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:58:53,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397572470] [2022-07-12 18:58:53,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397572470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:58:53,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:58:53,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:58:53,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379418757] [2022-07-12 18:58:53,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:58:53,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:58:53,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:58:53,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:58:53,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:58:53,290 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:58:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:53,395 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2022-07-12 18:58:53,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:58:53,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 18:58:53,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:53,398 INFO L225 Difference]: With dead ends: 165 [2022-07-12 18:58:53,399 INFO L226 Difference]: Without dead ends: 165 [2022-07-12 18:58:53,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:58:53,408 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 74 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:53,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 217 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:58:53,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-12 18:58:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 98. [2022-07-12 18:58:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 89 states have internal predecessors, (99), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 18:58:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-07-12 18:58:53,425 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 8 [2022-07-12 18:58:53,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:53,425 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-07-12 18:58:53,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:58:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-07-12 18:58:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:58:53,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:53,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:58:53,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:58:53,427 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:58:53,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:53,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1124238034, now seen corresponding path program 1 times [2022-07-12 18:58:53,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:58:53,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487014837] [2022-07-12 18:58:53,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:53,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:58:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:58:53,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487014837] [2022-07-12 18:58:53,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487014837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:58:53,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:58:53,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:58:53,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991333994] [2022-07-12 18:58:53,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:58:53,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:58:53,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:58:53,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:58:53,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:58:53,513 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:58:53,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:53,582 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2022-07-12 18:58:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:58:53,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 18:58:53,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:53,585 INFO L225 Difference]: With dead ends: 176 [2022-07-12 18:58:53,585 INFO L226 Difference]: Without dead ends: 176 [2022-07-12 18:58:53,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:58:53,589 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 78 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:53,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 403 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:58:53,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-12 18:58:53,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 142. [2022-07-12 18:58:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.89247311827957) internal successors, (176), 129 states have internal predecessors, (176), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 18:58:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 196 transitions. [2022-07-12 18:58:53,617 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 196 transitions. Word has length 10 [2022-07-12 18:58:53,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:53,618 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 196 transitions. [2022-07-12 18:58:53,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:58:53,619 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 196 transitions. [2022-07-12 18:58:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:58:53,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:53,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:58:53,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:58:53,621 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:58:53,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:53,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1121620373, now seen corresponding path program 1 times [2022-07-12 18:58:53,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:58:53,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389843880] [2022-07-12 18:58:53,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:53,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:58:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:53,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:58:53,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389843880] [2022-07-12 18:58:53,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389843880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:58:53,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:58:53,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:58:53,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780977655] [2022-07-12 18:58:53,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:58:53,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:58:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:58:53,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:58:53,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:58:53,731 INFO L87 Difference]: Start difference. First operand 142 states and 196 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:58:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:53,849 INFO L93 Difference]: Finished difference Result 140 states and 192 transitions. [2022-07-12 18:58:53,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:58:53,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 18:58:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:53,851 INFO L225 Difference]: With dead ends: 140 [2022-07-12 18:58:53,851 INFO L226 Difference]: Without dead ends: 140 [2022-07-12 18:58:53,851 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 [2022-07-12 18:58:53,852 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 218 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:53,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 105 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:58:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-12 18:58:53,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-07-12 18:58:53,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 127 states have internal predecessors, (172), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 18:58:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2022-07-12 18:58:53,865 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 10 [2022-07-12 18:58:53,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:53,865 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2022-07-12 18:58:53,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:58:53,866 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2022-07-12 18:58:53,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:58:53,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:53,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:58:53,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:58:53,867 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:58:53,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:53,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1910990355, now seen corresponding path program 1 times [2022-07-12 18:58:53,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:58:53,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767305500] [2022-07-12 18:58:53,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:53,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:58:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:53,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:58:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:53,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:58:53,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767305500] [2022-07-12 18:58:53,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767305500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:58:53,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:58:53,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:58:53,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341879840] [2022-07-12 18:58:53,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:58:53,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:58:53,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:58:53,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:58:53,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:58:53,970 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:58:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:54,169 INFO L93 Difference]: Finished difference Result 159 states and 184 transitions. [2022-07-12 18:58:54,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:58:54,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-12 18:58:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:54,171 INFO L225 Difference]: With dead ends: 159 [2022-07-12 18:58:54,171 INFO L226 Difference]: Without dead ends: 159 [2022-07-12 18:58:54,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:58:54,173 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 238 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:54,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 203 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:58:54,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-12 18:58:54,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 135. [2022-07-12 18:58:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.7311827956989247) internal successors, (161), 122 states have internal predecessors, (161), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 18:58:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 181 transitions. [2022-07-12 18:58:54,180 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 181 transitions. Word has length 15 [2022-07-12 18:58:54,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:54,180 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 181 transitions. [2022-07-12 18:58:54,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:58:54,181 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 181 transitions. [2022-07-12 18:58:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:58:54,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:54,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:58:54,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:58:54,182 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:58:54,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:54,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1910990356, now seen corresponding path program 1 times [2022-07-12 18:58:54,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:58:54,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088591039] [2022-07-12 18:58:54,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:54,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:58:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:54,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:58:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:54,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:58:54,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088591039] [2022-07-12 18:58:54,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088591039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:58:54,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:58:54,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:58:54,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668394484] [2022-07-12 18:58:54,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:58:54,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:58:54,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:58:54,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:58:54,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:58:54,286 INFO L87 Difference]: Start difference. First operand 135 states and 181 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:58:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:54,521 INFO L93 Difference]: Finished difference Result 155 states and 179 transitions. [2022-07-12 18:58:54,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:58:54,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-12 18:58:54,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:54,525 INFO L225 Difference]: With dead ends: 155 [2022-07-12 18:58:54,525 INFO L226 Difference]: Without dead ends: 155 [2022-07-12 18:58:54,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:58:54,526 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 288 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:54,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 186 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:58:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-12 18:58:54,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2022-07-12 18:58:54,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.6666666666666667) internal successors, (155), 122 states have internal predecessors, (155), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 18:58:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2022-07-12 18:58:54,532 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 15 [2022-07-12 18:58:54,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:54,533 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2022-07-12 18:58:54,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:58:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2022-07-12 18:58:54,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:58:54,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:54,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:58:54,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:58:54,534 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:58:54,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:54,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148901, now seen corresponding path program 1 times [2022-07-12 18:58:54,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:58:54,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784947604] [2022-07-12 18:58:54,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:54,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:58:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:54,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:58:54,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784947604] [2022-07-12 18:58:54,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784947604] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:58:54,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158409356] [2022-07-12 18:58:54,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:54,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:58:54,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:58:54,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:58:54,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 18:58:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:54,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 18:58:54,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:58:54,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:58:54,799 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:58:54,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 18:58:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:54,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:58:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:55,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158409356] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:58:55,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:58:55,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2022-07-12 18:58:55,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081764432] [2022-07-12 18:58:55,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:58:55,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 18:58:55,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:58:55,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 18:58:55,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:58:55,109 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:58:55,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:55,579 INFO L93 Difference]: Finished difference Result 200 states and 254 transitions. [2022-07-12 18:58:55,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:58:55,580 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:58:55,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:55,581 INFO L225 Difference]: With dead ends: 200 [2022-07-12 18:58:55,581 INFO L226 Difference]: Without dead ends: 200 [2022-07-12 18:58:55,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:58:55,582 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 362 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:55,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 447 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:58:55,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-12 18:58:55,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 143. [2022-07-12 18:58:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.65) internal successors, (165), 128 states have internal predecessors, (165), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-12 18:58:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 187 transitions. [2022-07-12 18:58:55,589 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 187 transitions. Word has length 16 [2022-07-12 18:58:55,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:55,595 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 187 transitions. [2022-07-12 18:58:55,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:58:55,596 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 187 transitions. [2022-07-12 18:58:55,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:58:55,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:55,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:58:55,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:58:55,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:58:55,820 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:58:55,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:55,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148902, now seen corresponding path program 1 times [2022-07-12 18:58:55,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:58:55,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314320987] [2022-07-12 18:58:55,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:55,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:58:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:55,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:58:55,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314320987] [2022-07-12 18:58:55,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314320987] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:58:55,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891375477] [2022-07-12 18:58:55,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:55,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:58:55,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:58:55,908 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:58:55,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 18:58:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:56,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 18:58:56,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:58:56,039 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:58:56,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 18:58:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:56,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:58:56,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-12 18:58:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:56,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891375477] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:58:56,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:58:56,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2022-07-12 18:58:56,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176047127] [2022-07-12 18:58:56,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:58:56,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 18:58:56,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:58:56,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 18:58:56,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:58:56,411 INFO L87 Difference]: Start difference. First operand 143 states and 187 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:58:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:56,952 INFO L93 Difference]: Finished difference Result 197 states and 251 transitions. [2022-07-12 18:58:56,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:58:56,953 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:58:56,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:56,954 INFO L225 Difference]: With dead ends: 197 [2022-07-12 18:58:56,954 INFO L226 Difference]: Without dead ends: 197 [2022-07-12 18:58:56,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:58:56,955 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 495 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:56,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 497 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:58:56,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-12 18:58:56,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 142. [2022-07-12 18:58:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 100 states have (on average 1.62) internal successors, (162), 127 states have internal predecessors, (162), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-12 18:58:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 184 transitions. [2022-07-12 18:58:56,961 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 184 transitions. Word has length 16 [2022-07-12 18:58:56,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:56,961 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 184 transitions. [2022-07-12 18:58:56,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:58:56,961 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 184 transitions. [2022-07-12 18:58:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 18:58:56,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:56,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:58:56,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 18:58:57,179 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,SelfDestructingSolverStorable9 [2022-07-12 18:58:57,180 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:58:57,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:57,180 INFO L85 PathProgramCache]: Analyzing trace with hash -992190633, now seen corresponding path program 1 times [2022-07-12 18:58:57,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:58:57,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578246311] [2022-07-12 18:58:57,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:57,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:58:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:57,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:58:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:57,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:58:57,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578246311] [2022-07-12 18:58:57,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578246311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:58:57,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:58:57,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:58:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228495248] [2022-07-12 18:58:57,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:58:57,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:58:57,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:58:57,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:58:57,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:58:57,322 INFO L87 Difference]: Start difference. First operand 142 states and 184 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:58:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:57,518 INFO L93 Difference]: Finished difference Result 190 states and 242 transitions. [2022-07-12 18:58:57,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:58:57,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-12 18:58:57,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:57,519 INFO L225 Difference]: With dead ends: 190 [2022-07-12 18:58:57,520 INFO L226 Difference]: Without dead ends: 190 [2022-07-12 18:58:57,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:58:57,520 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 187 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:57,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 395 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:58:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-12 18:58:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 150. [2022-07-12 18:58:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 107 states have (on average 1.5981308411214954) internal successors, (171), 134 states have internal predecessors, (171), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-12 18:58:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 195 transitions. [2022-07-12 18:58:57,525 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 195 transitions. Word has length 19 [2022-07-12 18:58:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:57,525 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 195 transitions. [2022-07-12 18:58:57,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:58:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 195 transitions. [2022-07-12 18:58:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:58:57,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:57,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:58:57,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 18:58:57,527 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:58:57,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:57,529 INFO L85 PathProgramCache]: Analyzing trace with hash 343557913, now seen corresponding path program 1 times [2022-07-12 18:58:57,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:58:57,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270760950] [2022-07-12 18:58:57,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:57,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:58:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:57,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:58:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:57,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:58:57,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270760950] [2022-07-12 18:58:57,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270760950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:58:57,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:58:57,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:58:57,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959599786] [2022-07-12 18:58:57,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:58:57,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:58:57,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:58:57,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:58:57,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:58:57,622 INFO L87 Difference]: Start difference. First operand 150 states and 195 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:58:57,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:57,755 INFO L93 Difference]: Finished difference Result 185 states and 236 transitions. [2022-07-12 18:58:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:58:57,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-12 18:58:57,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:57,759 INFO L225 Difference]: With dead ends: 185 [2022-07-12 18:58:57,759 INFO L226 Difference]: Without dead ends: 185 [2022-07-12 18:58:57,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:58:57,760 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 135 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:57,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 397 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:58:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-12 18:58:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 152. [2022-07-12 18:58:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 109 states have (on average 1.5871559633027523) internal successors, (173), 136 states have internal predecessors, (173), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-12 18:58:57,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 197 transitions. [2022-07-12 18:58:57,767 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 197 transitions. Word has length 21 [2022-07-12 18:58:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:57,768 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 197 transitions. [2022-07-12 18:58:57,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:58:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 197 transitions. [2022-07-12 18:58:57,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:58:57,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:57,770 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] [2022-07-12 18:58:57,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 18:58:57,770 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:58:57,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:57,770 INFO L85 PathProgramCache]: Analyzing trace with hash 451808416, now seen corresponding path program 1 times [2022-07-12 18:58:57,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:58:57,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015122042] [2022-07-12 18:58:57,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:57,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:58:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:57,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:58:57,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015122042] [2022-07-12 18:58:57,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015122042] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:58:57,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377605457] [2022-07-12 18:58:57,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:57,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:58:57,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:58:57,922 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:58:57,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 18:58:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:58,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 18:58:58,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:58:58,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:58:58,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:58:58,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 18:58:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:58,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:58:58,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-07-12 18:58:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:58:58,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377605457] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:58:58,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:58:58,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2022-07-12 18:58:58,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705615295] [2022-07-12 18:58:58,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:58:58,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 18:58:58,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:58:58,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 18:58:58,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2022-07-12 18:58:58,434 INFO L87 Difference]: Start difference. First operand 152 states and 197 transitions. Second operand has 24 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:00,006 INFO L93 Difference]: Finished difference Result 500 states and 656 transitions. [2022-07-12 18:59:00,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:59:00,007 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 18:59:00,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:00,010 INFO L225 Difference]: With dead ends: 500 [2022-07-12 18:59:00,010 INFO L226 Difference]: Without dead ends: 500 [2022-07-12 18:59:00,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=1426, Unknown=0, NotChecked=0, Total=1640 [2022-07-12 18:59:00,012 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 1024 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:00,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1635 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1932 Invalid, 0 Unknown, 100 Unchecked, 1.2s Time] [2022-07-12 18:59:00,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-07-12 18:59:00,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 237. [2022-07-12 18:59:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 176 states have (on average 1.5795454545454546) internal successors, (278), 206 states have internal predecessors, (278), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-12 18:59:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 328 transitions. [2022-07-12 18:59:00,025 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 328 transitions. Word has length 22 [2022-07-12 18:59:00,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:00,025 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 328 transitions. [2022-07-12 18:59:00,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:00,026 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 328 transitions. [2022-07-12 18:59:00,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:59:00,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:00,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:00,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 18:59:00,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:00,240 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:00,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:00,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1286860128, now seen corresponding path program 1 times [2022-07-12 18:59:00,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:00,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74145371] [2022-07-12 18:59:00,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:00,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:00,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 18:59:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:00,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:00,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74145371] [2022-07-12 18:59:00,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74145371] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:00,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877330099] [2022-07-12 18:59:00,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:00,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:00,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:00,298 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:59:00,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 18:59:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:00,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:59:00,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:00,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:00,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877330099] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:59:00,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:59:00,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-12 18:59:00,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007114843] [2022-07-12 18:59:00,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:00,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 18:59:00,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:00,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 18:59:00,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:59:00,549 INFO L87 Difference]: Start difference. First operand 237 states and 328 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 18:59:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:00,960 INFO L93 Difference]: Finished difference Result 305 states and 388 transitions. [2022-07-12 18:59:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:59:00,961 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2022-07-12 18:59:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:00,962 INFO L225 Difference]: With dead ends: 305 [2022-07-12 18:59:00,963 INFO L226 Difference]: Without dead ends: 299 [2022-07-12 18:59:00,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:59:00,964 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 299 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:00,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 630 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:59:00,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-12 18:59:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 237. [2022-07-12 18:59:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 176 states have (on average 1.5625) internal successors, (275), 206 states have internal predecessors, (275), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-12 18:59:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 325 transitions. [2022-07-12 18:59:00,972 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 325 transitions. Word has length 21 [2022-07-12 18:59:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:00,972 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 325 transitions. [2022-07-12 18:59:00,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 18:59:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2022-07-12 18:59:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:59:00,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:00,974 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] [2022-07-12 18:59:01,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:01,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:01,188 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:01,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:01,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1821114983, now seen corresponding path program 1 times [2022-07-12 18:59:01,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:01,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577048142] [2022-07-12 18:59:01,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:01,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:01,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:59:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:01,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:01,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577048142] [2022-07-12 18:59:01,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577048142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:01,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:01,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:59:01,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584081426] [2022-07-12 18:59:01,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:01,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:59:01,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:01,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:59:01,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:01,228 INFO L87 Difference]: Start difference. First operand 237 states and 325 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:01,248 INFO L93 Difference]: Finished difference Result 251 states and 343 transitions. [2022-07-12 18:59:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:59:01,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-07-12 18:59:01,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:01,251 INFO L225 Difference]: With dead ends: 251 [2022-07-12 18:59:01,251 INFO L226 Difference]: Without dead ends: 251 [2022-07-12 18:59:01,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:59:01,252 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:01,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 389 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:59:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-12 18:59:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 246. [2022-07-12 18:59:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 179 states have (on average 1.553072625698324) internal successors, (278), 214 states have internal predecessors, (278), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-12 18:59:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 338 transitions. [2022-07-12 18:59:01,260 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 338 transitions. Word has length 24 [2022-07-12 18:59:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:01,261 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 338 transitions. [2022-07-12 18:59:01,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 338 transitions. [2022-07-12 18:59:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:59:01,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:01,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:01,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:59:01,262 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:01,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:01,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1983275188, now seen corresponding path program 1 times [2022-07-12 18:59:01,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:01,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093758247] [2022-07-12 18:59:01,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:01,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:01,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 18:59:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:01,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:01,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:01,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093758247] [2022-07-12 18:59:01,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093758247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:01,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:01,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:59:01,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748741523] [2022-07-12 18:59:01,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:01,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:59:01,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:01,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:59:01,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:01,302 INFO L87 Difference]: Start difference. First operand 246 states and 338 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:01,505 INFO L93 Difference]: Finished difference Result 304 states and 389 transitions. [2022-07-12 18:59:01,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:59:01,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-07-12 18:59:01,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:01,507 INFO L225 Difference]: With dead ends: 304 [2022-07-12 18:59:01,507 INFO L226 Difference]: Without dead ends: 304 [2022-07-12 18:59:01,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:59:01,508 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 206 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:01,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 254 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-12 18:59:01,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 245. [2022-07-12 18:59:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 179 states have (on average 1.541899441340782) internal successors, (276), 213 states have internal predecessors, (276), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-12 18:59:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 336 transitions. [2022-07-12 18:59:01,517 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 336 transitions. Word has length 23 [2022-07-12 18:59:01,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:01,518 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 336 transitions. [2022-07-12 18:59:01,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:01,518 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 336 transitions. [2022-07-12 18:59:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:59:01,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:01,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:01,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 18:59:01,519 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:01,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:01,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1983275187, now seen corresponding path program 1 times [2022-07-12 18:59:01,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:01,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710055504] [2022-07-12 18:59:01,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:01,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:01,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 18:59:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:01,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:01,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710055504] [2022-07-12 18:59:01,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710055504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:01,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:01,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:59:01,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408049190] [2022-07-12 18:59:01,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:01,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:59:01,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:01,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:59:01,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:01,578 INFO L87 Difference]: Start difference. First operand 245 states and 336 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:01,765 INFO L93 Difference]: Finished difference Result 302 states and 382 transitions. [2022-07-12 18:59:01,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:59:01,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-07-12 18:59:01,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:01,768 INFO L225 Difference]: With dead ends: 302 [2022-07-12 18:59:01,768 INFO L226 Difference]: Without dead ends: 302 [2022-07-12 18:59:01,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:59:01,769 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 194 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:01,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 349 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-07-12 18:59:01,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 239. [2022-07-12 18:59:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 179 states have (on average 1.4916201117318435) internal successors, (267), 207 states have internal predecessors, (267), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-12 18:59:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 327 transitions. [2022-07-12 18:59:01,778 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 327 transitions. Word has length 23 [2022-07-12 18:59:01,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:01,778 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 327 transitions. [2022-07-12 18:59:01,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:01,779 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 327 transitions. [2022-07-12 18:59:01,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 18:59:01,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:01,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:01,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 18:59:01,780 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:01,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:01,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2147398490, now seen corresponding path program 1 times [2022-07-12 18:59:01,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:01,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318411021] [2022-07-12 18:59:01,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:01,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:02,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 18:59:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:02,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:02,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:02,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318411021] [2022-07-12 18:59:02,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318411021] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:02,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893005371] [2022-07-12 18:59:02,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:02,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:02,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:02,205 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:59:02,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 18:59:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:02,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 18:59:02,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:02,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:59:02,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:59:02,633 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:02,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 18:59:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:02,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:02,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893005371] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:02,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:59:02,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2022-07-12 18:59:02,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535318140] [2022-07-12 18:59:02,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:02,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 18:59:02,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:02,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 18:59:02,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2022-07-12 18:59:02,840 INFO L87 Difference]: Start difference. First operand 239 states and 327 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:59:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:04,681 INFO L93 Difference]: Finished difference Result 552 states and 721 transitions. [2022-07-12 18:59:04,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 18:59:04,682 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-12 18:59:04,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:04,684 INFO L225 Difference]: With dead ends: 552 [2022-07-12 18:59:04,684 INFO L226 Difference]: Without dead ends: 552 [2022-07-12 18:59:04,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=316, Invalid=1576, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 18:59:04,685 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 594 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 654 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:04,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1968 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1669 Invalid, 0 Unknown, 654 Unchecked, 1.0s Time] [2022-07-12 18:59:04,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-07-12 18:59:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 252. [2022-07-12 18:59:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 190 states have (on average 1.4736842105263157) internal successors, (280), 218 states have internal predecessors, (280), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (31), 22 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-12 18:59:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 342 transitions. [2022-07-12 18:59:04,697 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 342 transitions. Word has length 25 [2022-07-12 18:59:04,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:04,697 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 342 transitions. [2022-07-12 18:59:04,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:59:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 342 transitions. [2022-07-12 18:59:04,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 18:59:04,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:04,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:04,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:04,920 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,SelfDestructingSolverStorable17 [2022-07-12 18:59:04,920 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:04,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:04,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2147398489, now seen corresponding path program 1 times [2022-07-12 18:59:04,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:04,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421402937] [2022-07-12 18:59:04,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:04,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:05,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 18:59:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:05,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:05,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421402937] [2022-07-12 18:59:05,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421402937] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:05,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964942804] [2022-07-12 18:59:05,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:05,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:05,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:05,368 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:59:05,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 18:59:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:05,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-12 18:59:05,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:05,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:59:05,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:59:05,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-12 18:59:05,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 18:59:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:05,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:05,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2022-07-12 18:59:05,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 106 [2022-07-12 18:59:05,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:05,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:05,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-12 18:59:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:05,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964942804] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:59:05,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:59:05,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 7] total 26 [2022-07-12 18:59:05,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194509684] [2022-07-12 18:59:05,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:05,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 18:59:05,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:05,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 18:59:05,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2022-07-12 18:59:05,947 INFO L87 Difference]: Start difference. First operand 252 states and 342 transitions. Second operand has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 18:59:07,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:07,451 INFO L93 Difference]: Finished difference Result 410 states and 506 transitions. [2022-07-12 18:59:07,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 18:59:07,452 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2022-07-12 18:59:07,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:07,454 INFO L225 Difference]: With dead ends: 410 [2022-07-12 18:59:07,454 INFO L226 Difference]: Without dead ends: 410 [2022-07-12 18:59:07,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=254, Invalid=1386, Unknown=0, NotChecked=0, Total=1640 [2022-07-12 18:59:07,455 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 582 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:07,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1297 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1483 Invalid, 0 Unknown, 80 Unchecked, 0.8s Time] [2022-07-12 18:59:07,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-12 18:59:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 261. [2022-07-12 18:59:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 196 states have (on average 1.4489795918367347) internal successors, (284), 225 states have internal predecessors, (284), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 22 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-12 18:59:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 348 transitions. [2022-07-12 18:59:07,463 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 348 transitions. Word has length 25 [2022-07-12 18:59:07,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:07,464 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 348 transitions. [2022-07-12 18:59:07,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 18:59:07,464 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 348 transitions. [2022-07-12 18:59:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:59:07,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:07,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:07,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:07,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:07,680 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:07,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:07,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1195361463, now seen corresponding path program 1 times [2022-07-12 18:59:07,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:07,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429610065] [2022-07-12 18:59:07,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:07,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:07,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:59:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:07,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 18:59:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:07,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:07,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429610065] [2022-07-12 18:59:07,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429610065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:07,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:07,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:59:07,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049904164] [2022-07-12 18:59:07,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:07,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:59:07,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:07,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:59:07,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:59:07,727 INFO L87 Difference]: Start difference. First operand 261 states and 348 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:59:07,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:07,882 INFO L93 Difference]: Finished difference Result 271 states and 340 transitions. [2022-07-12 18:59:07,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:59:07,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-12 18:59:07,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:07,884 INFO L225 Difference]: With dead ends: 271 [2022-07-12 18:59:07,885 INFO L226 Difference]: Without dead ends: 271 [2022-07-12 18:59:07,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:59:07,885 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 159 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:07,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 195 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-12 18:59:07,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 258. [2022-07-12 18:59:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 196 states have (on average 1.3928571428571428) internal successors, (273), 222 states have internal predecessors, (273), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 22 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-12 18:59:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 337 transitions. [2022-07-12 18:59:07,893 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 337 transitions. Word has length 27 [2022-07-12 18:59:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:07,893 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 337 transitions. [2022-07-12 18:59:07,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:59:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 337 transitions. [2022-07-12 18:59:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:59:07,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:07,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:07,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 18:59:07,894 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:07,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1195361464, now seen corresponding path program 1 times [2022-07-12 18:59:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:07,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138784836] [2022-07-12 18:59:07,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:07,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:07,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:59:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:07,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 18:59:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:07,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:07,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138784836] [2022-07-12 18:59:07,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138784836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:07,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:07,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:59:07,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409649139] [2022-07-12 18:59:07,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:07,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:59:07,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:07,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:59:07,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:59:07,954 INFO L87 Difference]: Start difference. First operand 258 states and 337 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:59:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:08,113 INFO L93 Difference]: Finished difference Result 269 states and 335 transitions. [2022-07-12 18:59:08,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:59:08,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-12 18:59:08,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:08,114 INFO L225 Difference]: With dead ends: 269 [2022-07-12 18:59:08,114 INFO L226 Difference]: Without dead ends: 269 [2022-07-12 18:59:08,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:59:08,115 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 214 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:08,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 167 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:08,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-12 18:59:08,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 258. [2022-07-12 18:59:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 196 states have (on average 1.3622448979591837) internal successors, (267), 222 states have internal predecessors, (267), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 22 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-12 18:59:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 331 transitions. [2022-07-12 18:59:08,122 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 331 transitions. Word has length 27 [2022-07-12 18:59:08,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:08,122 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 331 transitions. [2022-07-12 18:59:08,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:59:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 331 transitions. [2022-07-12 18:59:08,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:59:08,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:08,127 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] [2022-07-12 18:59:08,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 18:59:08,128 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:08,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:08,128 INFO L85 PathProgramCache]: Analyzing trace with hash 468828335, now seen corresponding path program 1 times [2022-07-12 18:59:08,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:08,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317827144] [2022-07-12 18:59:08,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:08,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:08,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 18:59:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:59:08,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:08,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317827144] [2022-07-12 18:59:08,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317827144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:08,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:08,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:59:08,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579008094] [2022-07-12 18:59:08,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:08,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:59:08,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:08,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:59:08,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:08,156 INFO L87 Difference]: Start difference. First operand 258 states and 331 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:08,165 INFO L93 Difference]: Finished difference Result 267 states and 341 transitions. [2022-07-12 18:59:08,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:59:08,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-07-12 18:59:08,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:08,167 INFO L225 Difference]: With dead ends: 267 [2022-07-12 18:59:08,167 INFO L226 Difference]: Without dead ends: 267 [2022-07-12 18:59:08,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:08,169 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:08,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 193 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:59:08,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-12 18:59:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 238. [2022-07-12 18:59:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 180 states have (on average 1.3611111111111112) internal successors, (245), 205 states have internal predecessors, (245), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-12 18:59:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 305 transitions. [2022-07-12 18:59:08,179 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 305 transitions. Word has length 26 [2022-07-12 18:59:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:08,179 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 305 transitions. [2022-07-12 18:59:08,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 305 transitions. [2022-07-12 18:59:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:59:08,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:08,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:08,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 18:59:08,180 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:08,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:08,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1109218320, now seen corresponding path program 1 times [2022-07-12 18:59:08,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:08,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826177707] [2022-07-12 18:59:08,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:08,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:08,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 18:59:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:59:08,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:08,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826177707] [2022-07-12 18:59:08,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826177707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:08,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:08,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:59:08,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325669051] [2022-07-12 18:59:08,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:08,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:59:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:08,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:59:08,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:08,238 INFO L87 Difference]: Start difference. First operand 238 states and 305 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:08,256 INFO L93 Difference]: Finished difference Result 252 states and 324 transitions. [2022-07-12 18:59:08,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:59:08,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-12 18:59:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:08,259 INFO L225 Difference]: With dead ends: 252 [2022-07-12 18:59:08,259 INFO L226 Difference]: Without dead ends: 248 [2022-07-12 18:59:08,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:59:08,260 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:08,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 370 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:59:08,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-12 18:59:08,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2022-07-12 18:59:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 182 states have (on average 1.3571428571428572) internal successors, (247), 209 states have internal predecessors, (247), 30 states have call successors, (30), 11 states have call predecessors, (30), 13 states have return successors, (34), 21 states have call predecessors, (34), 30 states have call successors, (34) [2022-07-12 18:59:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 311 transitions. [2022-07-12 18:59:08,274 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 311 transitions. Word has length 27 [2022-07-12 18:59:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:08,274 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 311 transitions. [2022-07-12 18:59:08,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 311 transitions. [2022-07-12 18:59:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:59:08,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:08,275 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:08,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 18:59:08,275 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:08,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:08,278 INFO L85 PathProgramCache]: Analyzing trace with hash -815173774, now seen corresponding path program 1 times [2022-07-12 18:59:08,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:08,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663446984] [2022-07-12 18:59:08,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:08,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:08,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:08,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663446984] [2022-07-12 18:59:08,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663446984] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:08,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325912068] [2022-07-12 18:59:08,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:08,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:08,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:08,728 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:59:08,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 18:59:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:08,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-12 18:59:08,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:08,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:59:08,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:59:08,971 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:59:08,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-12 18:59:08,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 18:59:08,991 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:59:08,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-12 18:59:08,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 18:59:09,052 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:59:09,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-12 18:59:09,069 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:59:09,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-12 18:59:09,104 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-12 18:59:09,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2022-07-12 18:59:09,125 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-12 18:59:09,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2022-07-12 18:59:09,265 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:59:09,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:59:09,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:59:09,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-07-12 18:59:09,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2022-07-12 18:59:09,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2022-07-12 18:59:09,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-07-12 18:59:09,534 INFO L356 Elim1Store]: treesize reduction 26, result has 45.8 percent of original size [2022-07-12 18:59:09,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2022-07-12 18:59:09,550 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-12 18:59:09,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 18:59:10,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-07-12 18:59:10,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:59:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:10,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:11,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 132 treesize of output 108 [2022-07-12 18:59:11,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 108 [2022-07-12 18:59:17,780 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:17,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 308 treesize of output 378 [2022-07-12 18:59:21,046 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (forall ((v_prenex_10 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_10) (forall ((v_prenex_12 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_11 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_prenex_9 Int)) (or (<= 0 (+ (select (select (let ((.cse1 (+ v_prenex_9 4))) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_12))) v_prenex_10 v_prenex_11))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (or .cse3 (forall ((v_prenex_12 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_10 Int) (v_prenex_11 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_prenex_9 Int)) (or (<= 0 (+ (select (select (let ((.cse5 (+ v_prenex_9 4))) (let ((.cse4 (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 v_prenex_12))) v_prenex_10 v_prenex_11))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_10)))) (forall ((v_prenex_3 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_3) (forall ((v_prenex_5 Int) (v_prenex_2 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (select (let ((.cse8 (+ v_prenex_2 4))) (let ((.cse7 (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse8 v_prenex_5))) v_prenex_3 v_prenex_4))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse8 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (forall ((v_prenex_7 Int)) (or (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse10 (select (select (let ((.cse12 (+ v_prenex_6 4))) (let ((.cse11 (store (let ((.cse13 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse12 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_7 v_prenex_8))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse12 v_prenex_7)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse10 v_prenex_7) (= .cse10 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_7))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_21| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse15 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse17 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (select (let ((.cse14 (store (let ((.cse16 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse15 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse15 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17) 0) (= (select (select (let ((.cse18 (store (let ((.cse19 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse15 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse15 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17) |v_ULTIMATE.start_main_~n~0#1.base_21|) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (or .cse3 (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse20 (select (select (let ((.cse22 (+ v_prenex_6 4))) (let ((.cse21 (store (let ((.cse23 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse22 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_7 v_prenex_8))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse22 v_prenex_7)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse20 v_prenex_7) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_7) (= .cse20 0))))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse25 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse27 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (select (let ((.cse24 (store (let ((.cse26 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse24 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse27) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse28 (store (let ((.cse29 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse29 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse27) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) .cse3) (or (forall ((v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (select (let ((.cse31 (+ v_prenex_2 4))) (let ((.cse30 (store (let ((.cse32 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse32 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse31 v_prenex_5))) v_prenex_3 v_prenex_4))) (store .cse30 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse31 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_3))) .cse3))) is different from false [2022-07-12 18:59:21,257 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) (and (forall ((v_prenex_10 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_10) (forall ((v_prenex_12 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_11 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_prenex_9 Int)) (or (<= 0 (+ (select (select (let ((.cse1 (+ v_prenex_9 4))) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_12))) v_prenex_10 v_prenex_11))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse4 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse6 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (select (let ((.cse3 (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse3 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse7 (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse6) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) .cse9) (or (forall ((v_prenex_12 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_10 Int) (v_prenex_11 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_prenex_9 Int)) (or (<= 0 (+ (select (select (let ((.cse11 (+ v_prenex_9 4))) (let ((.cse10 (store (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 v_prenex_12))) v_prenex_10 v_prenex_11))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse11 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_10))) .cse9) (or (forall ((v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (select (let ((.cse14 (+ v_prenex_2 4))) (let ((.cse13 (store (let ((.cse15 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse14 v_prenex_5))) v_prenex_3 v_prenex_4))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse14 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_3))) .cse9) (or (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse16 (select (select (let ((.cse18 (+ v_prenex_6 4))) (let ((.cse17 (store (let ((.cse19 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse18 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_7 v_prenex_8))) (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse18 v_prenex_7)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse16 v_prenex_7) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_7) (= .cse16 0)))) .cse9) (forall ((v_prenex_3 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_3) (forall ((v_prenex_5 Int) (v_prenex_2 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (select (let ((.cse21 (+ v_prenex_2 4))) (let ((.cse20 (store (let ((.cse22 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse21 v_prenex_5))) v_prenex_3 v_prenex_4))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse21 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (forall ((v_prenex_7 Int)) (or (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse23 (select (select (let ((.cse25 (+ v_prenex_6 4))) (let ((.cse24 (store (let ((.cse26 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_7 v_prenex_8))) (store .cse24 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse25 v_prenex_7)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse23 v_prenex_7) (= .cse23 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_7))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_21| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse28 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse30 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (select (let ((.cse27 (store (let ((.cse29 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse29 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse28 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse27 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse28 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse30) 0) (= (select (select (let ((.cse31 (store (let ((.cse32 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse32 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse28 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse31 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse28 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse30) |v_ULTIMATE.start_main_~n~0#1.base_21|) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) is different from false [2022-07-12 18:59:21,366 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_21| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~#list~0#1.base|) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse1 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (store (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1 0) .cse2) 0) (= (select (store (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1 |v_ULTIMATE.start_main_~n~0#1.base_21|) .cse2) |v_ULTIMATE.start_main_~n~0#1.base_21|) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (forall ((v_prenex_10 Int)) (or (forall ((v_prenex_12 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_11 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_prenex_9 Int)) (or (<= 0 (+ 4 (select (let ((.cse5 (+ v_prenex_9 4))) (store (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5 v_prenex_12))) v_prenex_10 v_prenex_11) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5 0)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (= v_prenex_10 |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((v_prenex_3 Int)) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_3) (forall ((v_prenex_5 Int) (v_prenex_2 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (let ((.cse7 (+ v_prenex_2 4))) (store (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse7 v_prenex_5))) v_prenex_3 v_prenex_4) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse7 0)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse9 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse10 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (store (select (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse9 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse9 0) .cse10) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (store (select (store (let ((.cse11 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse11 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse9 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse9 |v_ULTIMATE.start_main_~n~0#1.base_21|) .cse10) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) .cse12) (forall ((v_prenex_7 Int)) (or (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse13 (select (let ((.cse15 (+ v_prenex_6 4))) (store (select (store (let ((.cse14 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse14 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse15 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_7 v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse15 v_prenex_7)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse13 0) (= .cse13 v_prenex_7) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7))) (or (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse16 (select (let ((.cse18 (+ v_prenex_6 4))) (store (select (store (let ((.cse17 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse17 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse18 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_7 v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse18 v_prenex_7)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) (= .cse16 0) (= .cse16 v_prenex_7)))) .cse12) (or (forall ((v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_3) (<= (select (let ((.cse20 (+ v_prenex_2 4))) (store (select (store (let ((.cse19 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse19 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse20 v_prenex_5))) v_prenex_3 v_prenex_4) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse20 0)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0))) .cse12) (or (forall ((v_prenex_12 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_10 Int) (v_prenex_11 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_prenex_9 Int)) (or (<= 0 (+ 4 (select (let ((.cse22 (+ v_prenex_9 4))) (store (select (store (let ((.cse21 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse21 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse22 v_prenex_12))) v_prenex_10 v_prenex_11) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse22 0)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (= v_prenex_10 |c_ULTIMATE.start_main_~#list~0#1.base|))) .cse12))) is different from false [2022-07-12 18:59:21,405 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:21,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 44 [2022-07-12 18:59:21,408 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:59:21,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-07-12 18:59:21,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2022-07-12 18:59:21,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-12 18:59:21,425 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 18:59:21,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-07-12 18:59:21,430 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 18:59:21,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-07-12 18:59:21,435 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 18:59:21,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 1 [2022-07-12 18:59:21,443 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 18:59:21,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 1 [2022-07-12 18:59:21,446 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-12 18:59:21,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325912068] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:59:21,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:59:21,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 20] total 49 [2022-07-12 18:59:21,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724982765] [2022-07-12 18:59:21,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:21,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-12 18:59:21,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:21,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-12 18:59:21,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1998, Unknown=7, NotChecked=276, Total=2450 [2022-07-12 18:59:21,451 INFO L87 Difference]: Start difference. First operand 242 states and 311 transitions. Second operand has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:21,503 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#length| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse14 (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_21| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~#list~0#1.base|) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse1 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (store (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1 0) .cse2) 0) (= (select (store (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1 |v_ULTIMATE.start_main_~n~0#1.base_21|) .cse2) |v_ULTIMATE.start_main_~n~0#1.base_21|) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (<= .cse4 8) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (forall ((v_prenex_10 Int)) (or (forall ((v_prenex_12 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_11 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_prenex_9 Int)) (or (<= 0 (+ 4 (select (let ((.cse7 (+ v_prenex_9 4))) (store (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse7 v_prenex_12))) v_prenex_10 v_prenex_11) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse7 0)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (= v_prenex_10 |c_ULTIMATE.start_main_~#list~0#1.base|))) (forall ((v_prenex_3 Int)) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_3) (forall ((v_prenex_5 Int) (v_prenex_2 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (let ((.cse9 (+ v_prenex_2 4))) (store (select (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse9 v_prenex_5))) v_prenex_3 v_prenex_4) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse9 0)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (<= 8 .cse4) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse11 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse12 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (store (select (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse11 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse11 0) .cse12) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (store (select (store (let ((.cse13 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse13 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse11 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse11 |v_ULTIMATE.start_main_~n~0#1.base_21|) .cse12) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) .cse14) (forall ((v_prenex_7 Int)) (or (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse15 (select (let ((.cse17 (+ v_prenex_6 4))) (store (select (store (let ((.cse16 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse16 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_7 v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse17 v_prenex_7)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse15 0) (= .cse15 v_prenex_7) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))) (= |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7))) (or (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse18 (select (let ((.cse20 (+ v_prenex_6 4))) (store (select (store (let ((.cse19 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse19 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse20 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_7 v_prenex_8) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse20 v_prenex_7)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_7) (= .cse18 0) (= .cse18 v_prenex_7)))) .cse14) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) 0) (or (forall ((v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_3) (<= (select (let ((.cse22 (+ v_prenex_2 4))) (store (select (store (let ((.cse21 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse21 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse22 v_prenex_5))) v_prenex_3 v_prenex_4) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse22 0)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0))) .cse14) .cse14 (or (forall ((v_prenex_12 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_10 Int) (v_prenex_11 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_prenex_9 Int)) (or (<= 0 (+ 4 (select (let ((.cse24 (+ v_prenex_9 4))) (store (select (store (let ((.cse23 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse23 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse24 v_prenex_12))) v_prenex_10 v_prenex_11) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse24 0)) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (= v_prenex_10 |c_ULTIMATE.start_main_~#list~0#1.base|))) .cse14))) is different from false [2022-07-12 18:59:21,518 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#length| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse11 (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) (and (forall ((v_prenex_10 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_10) (forall ((v_prenex_12 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_11 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_prenex_9 Int)) (or (<= 0 (+ (select (select (let ((.cse1 (+ v_prenex_9 4))) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_12))) v_prenex_10 v_prenex_11))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (<= .cse3 8) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse6 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse8 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (select (let ((.cse5 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse8) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse9 (store (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse8) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) .cse11) (or (forall ((v_prenex_12 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_10 Int) (v_prenex_11 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_prenex_9 Int)) (or (<= 0 (+ (select (select (let ((.cse13 (+ v_prenex_9 4))) (let ((.cse12 (store (let ((.cse14 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 v_prenex_12))) v_prenex_10 v_prenex_11))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse13 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_10))) .cse11) (<= 8 .cse3) (or (forall ((v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (select (let ((.cse16 (+ v_prenex_2 4))) (let ((.cse15 (store (let ((.cse17 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse16 v_prenex_5))) v_prenex_3 v_prenex_4))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse16 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_3))) .cse11) (or (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse18 (select (select (let ((.cse20 (+ v_prenex_6 4))) (let ((.cse19 (store (let ((.cse21 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse21 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse20 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_7 v_prenex_8))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse20 v_prenex_7)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse18 v_prenex_7) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_7) (= .cse18 0)))) .cse11) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 0) (forall ((v_prenex_3 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_3) (forall ((v_prenex_5 Int) (v_prenex_2 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (select (let ((.cse23 (+ v_prenex_2 4))) (let ((.cse22 (store (let ((.cse24 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse24 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse23 v_prenex_5))) v_prenex_3 v_prenex_4))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse23 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (forall ((v_prenex_7 Int)) (or (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse25 (select (select (let ((.cse27 (+ v_prenex_6 4))) (let ((.cse26 (store (let ((.cse28 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_7 v_prenex_8))) (store .cse26 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse27 v_prenex_7)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse25 v_prenex_7) (= .cse25 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_7))) (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_21| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse30 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse32 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (select (let ((.cse29 (store (let ((.cse31 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse31 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse31 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse30 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse29 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse29 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse30 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse32) 0) (= (select (select (let ((.cse33 (store (let ((.cse34 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse34 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse34 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse30 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse33 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse33 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse30 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse32) |v_ULTIMATE.start_main_~n~0#1.base_21|) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse11 (= |c_ULTIMATE.start_main_~tail~0#1.offset| 0))) is different from false [2022-07-12 18:59:21,539 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse5 (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_main_~n~0#1.offset| 0)) (.cse3 (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (forall ((v_prenex_10 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_10) (forall ((v_prenex_12 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_11 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_prenex_9 Int)) (or (<= 0 (+ (select (select (let ((.cse1 (+ v_prenex_9 4))) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_prenex_12))) v_prenex_10 v_prenex_11))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (or (and .cse3 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (let ((.cse4 (select |c_#length| |c_ULTIMATE.start_main_~tail~0#1.base|))) (and (<= 8 .cse4) .cse5 .cse6 (<= .cse4 8)))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse7)) (or .cse3 (forall ((v_prenex_12 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_10 Int) (v_prenex_11 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_prenex_9 Int)) (or (<= 0 (+ (select (select (let ((.cse9 (+ v_prenex_9 4))) (let ((.cse8 (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse9 v_prenex_12))) v_prenex_10 v_prenex_11))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse9 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 4)) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_10)))) (= (+ |c_ULTIMATE.start_main_~#list~0#1.offset| (* |c_ULTIMATE.start_main_~tail~0#1.offset| (- 1))) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse7) 0) (forall ((v_prenex_3 Int)) (or (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_3) (forall ((v_prenex_5 Int) (v_prenex_2 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (select (let ((.cse12 (+ v_prenex_2 4))) (let ((.cse11 (store (let ((.cse13 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse13 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse12 v_prenex_5))) v_prenex_3 v_prenex_4))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse12 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))))) (forall ((v_prenex_7 Int)) (or (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse14 (select (select (let ((.cse16 (+ v_prenex_6 4))) (let ((.cse15 (store (let ((.cse17 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse16 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_7 v_prenex_8))) (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse16 v_prenex_7)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse14 v_prenex_7) (= .cse14 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_7))) .cse5 (forall ((|v_ULTIMATE.start_main_~n~0#1.base_21| Int)) (or (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse19 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse21 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (select (let ((.cse18 (store (let ((.cse20 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse19 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse19 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse21) 0) (= (select (select (let ((.cse22 (store (let ((.cse23 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse23 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse19 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse22 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse19 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse21) |v_ULTIMATE.start_main_~n~0#1.base_21|) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) .cse6 (or .cse3 (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse24 (select (select (let ((.cse26 (+ v_prenex_6 4))) (let ((.cse25 (store (let ((.cse27 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse27 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 |ULTIMATE.start_main_~n~0#1.base|))) v_prenex_7 v_prenex_8))) (store .cse25 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse26 v_prenex_7)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (or (= .cse24 v_prenex_7) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_7) (= .cse24 0))))) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse29 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse31 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (or (= (select (select (let ((.cse28 (store (let ((.cse30 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse30 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse29 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse28 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse29 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse31) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (= (select (select (let ((.cse32 (store (let ((.cse33 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse33 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse33 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse29 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse32 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse29 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse31) |v_ULTIMATE.start_main_~n~0#1.base_21|)))) .cse3) (or (forall ((v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (or (<= (select (select (let ((.cse35 (+ v_prenex_2 4))) (let ((.cse34 (store (let ((.cse36 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse36 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse36 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse35 v_prenex_5))) v_prenex_3 v_prenex_4))) (store .cse34 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse34 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse35 0)))) |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| v_prenex_3))) .cse3))) is different from false [2022-07-12 18:59:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:27,698 INFO L93 Difference]: Finished difference Result 743 states and 942 transitions. [2022-07-12 18:59:27,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-07-12 18:59:27,698 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 18:59:27,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:27,701 INFO L225 Difference]: With dead ends: 743 [2022-07-12 18:59:27,701 INFO L226 Difference]: Without dead ends: 743 [2022-07-12 18:59:27,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 91 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=623, Invalid=6873, Unknown=10, NotChecked=1050, Total=8556 [2022-07-12 18:59:27,704 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 1460 mSDsluCounter, 2338 mSDsCounter, 0 mSdLazyCounter, 2930 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 5883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 2930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2637 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:27,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 2521 Invalid, 5883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 2930 Invalid, 0 Unknown, 2637 Unchecked, 2.1s Time] [2022-07-12 18:59:27,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-07-12 18:59:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 327. [2022-07-12 18:59:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 252 states have (on average 1.3492063492063493) internal successors, (340), 283 states have internal predecessors, (340), 40 states have call successors, (40), 15 states have call predecessors, (40), 18 states have return successors, (46), 28 states have call predecessors, (46), 40 states have call successors, (46) [2022-07-12 18:59:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 426 transitions. [2022-07-12 18:59:27,729 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 426 transitions. Word has length 28 [2022-07-12 18:59:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:27,729 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 426 transitions. [2022-07-12 18:59:27,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 426 transitions. [2022-07-12 18:59:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:59:27,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:27,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:27,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:27,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:27,955 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:27,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:27,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1709630296, now seen corresponding path program 1 times [2022-07-12 18:59:27,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:27,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686597397] [2022-07-12 18:59:27,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:27,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:28,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 18:59:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:28,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:28,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686597397] [2022-07-12 18:59:28,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686597397] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:28,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747936863] [2022-07-12 18:59:28,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:28,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:28,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:28,195 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:59:28,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 18:59:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:28,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 18:59:28,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:28,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:59:28,503 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:28,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-12 18:59:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:28,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:28,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747936863] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:28,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:59:28,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2022-07-12 18:59:28,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702953419] [2022-07-12 18:59:28,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:28,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 18:59:28,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:28,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 18:59:28,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-07-12 18:59:28,639 INFO L87 Difference]: Start difference. First operand 327 states and 426 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:59:29,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:29,115 INFO L93 Difference]: Finished difference Result 348 states and 448 transitions. [2022-07-12 18:59:29,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 18:59:29,115 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-12 18:59:29,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:29,117 INFO L225 Difference]: With dead ends: 348 [2022-07-12 18:59:29,117 INFO L226 Difference]: Without dead ends: 347 [2022-07-12 18:59:29,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 18:59:29,118 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 150 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:29,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 892 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 348 Invalid, 0 Unknown, 137 Unchecked, 0.2s Time] [2022-07-12 18:59:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-12 18:59:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 308. [2022-07-12 18:59:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 238 states have (on average 1.3487394957983194) internal successors, (321), 267 states have internal predecessors, (321), 36 states have call successors, (36), 14 states have call predecessors, (36), 17 states have return successors, (42), 26 states have call predecessors, (42), 36 states have call successors, (42) [2022-07-12 18:59:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 399 transitions. [2022-07-12 18:59:29,126 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 399 transitions. Word has length 27 [2022-07-12 18:59:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:29,127 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 399 transitions. [2022-07-12 18:59:29,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:59:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2022-07-12 18:59:29,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:59:29,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:29,128 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:29,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:29,357 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,SelfDestructingSolverStorable24 [2022-07-12 18:59:29,358 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:29,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:29,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1952238210, now seen corresponding path program 1 times [2022-07-12 18:59:29,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:29,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399289758] [2022-07-12 18:59:29,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:29,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:29,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:59:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:29,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 18:59:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:59:29,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:29,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399289758] [2022-07-12 18:59:29,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399289758] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:29,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:29,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:59:29,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987878649] [2022-07-12 18:59:29,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:29,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:59:29,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:29,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:59:29,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:59:29,388 INFO L87 Difference]: Start difference. First operand 308 states and 399 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:59:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:29,414 INFO L93 Difference]: Finished difference Result 317 states and 400 transitions. [2022-07-12 18:59:29,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:59:29,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-07-12 18:59:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:29,416 INFO L225 Difference]: With dead ends: 317 [2022-07-12 18:59:29,416 INFO L226 Difference]: Without dead ends: 317 [2022-07-12 18:59:29,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:29,417 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 38 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:29,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 253 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:59:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-12 18:59:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2022-07-12 18:59:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 237 states have (on average 1.3459915611814346) internal successors, (319), 265 states have internal predecessors, (319), 34 states have call successors, (34), 14 states have call predecessors, (34), 17 states have return successors, (40), 25 states have call predecessors, (40), 34 states have call successors, (40) [2022-07-12 18:59:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 393 transitions. [2022-07-12 18:59:29,430 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 393 transitions. Word has length 30 [2022-07-12 18:59:29,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:29,431 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 393 transitions. [2022-07-12 18:59:29,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:59:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 393 transitions. [2022-07-12 18:59:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:59:29,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:29,432 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] [2022-07-12 18:59:29,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 18:59:29,433 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:29,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:29,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1439567607, now seen corresponding path program 1 times [2022-07-12 18:59:29,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:29,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559279036] [2022-07-12 18:59:29,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:29,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:29,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:59:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:29,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 18:59:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:29,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:29,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559279036] [2022-07-12 18:59:29,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559279036] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:29,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:29,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:59:29,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378642083] [2022-07-12 18:59:29,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:29,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:59:29,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:29,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:59:29,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:59:29,547 INFO L87 Difference]: Start difference. First operand 305 states and 393 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:59:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:29,711 INFO L93 Difference]: Finished difference Result 323 states and 414 transitions. [2022-07-12 18:59:29,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:59:29,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-07-12 18:59:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:29,713 INFO L225 Difference]: With dead ends: 323 [2022-07-12 18:59:29,713 INFO L226 Difference]: Without dead ends: 323 [2022-07-12 18:59:29,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:59:29,713 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 110 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:29,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 353 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-12 18:59:29,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 311. [2022-07-12 18:59:29,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 270 states have internal predecessors, (324), 35 states have call successors, (35), 14 states have call predecessors, (35), 17 states have return successors, (41), 26 states have call predecessors, (41), 35 states have call successors, (41) [2022-07-12 18:59:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 400 transitions. [2022-07-12 18:59:29,720 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 400 transitions. Word has length 30 [2022-07-12 18:59:29,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:29,720 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 400 transitions. [2022-07-12 18:59:29,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:59:29,721 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 400 transitions. [2022-07-12 18:59:29,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:59:29,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:29,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:29,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 18:59:29,722 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:29,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:29,722 INFO L85 PathProgramCache]: Analyzing trace with hash 453625093, now seen corresponding path program 1 times [2022-07-12 18:59:29,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:29,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560822547] [2022-07-12 18:59:29,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:29,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:29,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 18:59:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:29,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 18:59:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:29,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:29,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560822547] [2022-07-12 18:59:29,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560822547] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:29,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:29,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:59:29,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832370541] [2022-07-12 18:59:29,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:29,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:59:29,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:29,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:59:29,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:59:29,796 INFO L87 Difference]: Start difference. First operand 311 states and 400 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:59:29,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:29,958 INFO L93 Difference]: Finished difference Result 348 states and 445 transitions. [2022-07-12 18:59:29,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:59:29,959 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-07-12 18:59:29,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:29,960 INFO L225 Difference]: With dead ends: 348 [2022-07-12 18:59:29,960 INFO L226 Difference]: Without dead ends: 348 [2022-07-12 18:59:29,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:59:29,961 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 83 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:29,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 365 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-12 18:59:29,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 330. [2022-07-12 18:59:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 257 states have (on average 1.3307392996108949) internal successors, (342), 286 states have internal predecessors, (342), 39 states have call successors, (39), 14 states have call predecessors, (39), 17 states have return successors, (45), 29 states have call predecessors, (45), 39 states have call successors, (45) [2022-07-12 18:59:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 426 transitions. [2022-07-12 18:59:29,968 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 426 transitions. Word has length 32 [2022-07-12 18:59:29,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:29,968 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 426 transitions. [2022-07-12 18:59:29,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:59:29,969 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 426 transitions. [2022-07-12 18:59:29,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 18:59:29,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:29,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:29,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 18:59:29,970 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:29,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:29,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1579548114, now seen corresponding path program 1 times [2022-07-12 18:59:29,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:29,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888190434] [2022-07-12 18:59:29,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:29,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:30,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 18:59:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:30,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888190434] [2022-07-12 18:59:30,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888190434] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:30,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739220755] [2022-07-12 18:59:30,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:30,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:30,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:30,252 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:59:30,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 18:59:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:30,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-12 18:59:30,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:30,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:59:30,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:59:30,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:30,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:59:30,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:30,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:59:30,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:30,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:59:30,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:30,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:59:30,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:30,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:59:30,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:30,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:59:30,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 18:59:30,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 18:59:30,762 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:59:30,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2022-07-12 18:59:30,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:30,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 18:59:30,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:59:30,784 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:30,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-07-12 18:59:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:30,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:30,800 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1075) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0)) (forall ((v_ArrVal_1074 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1074) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0))) is different from false [2022-07-12 18:59:30,812 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (+ |c_ULTIMATE.start_remove_~x#1.offset| 4)) v_ArrVal_1075) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0)) (forall ((v_ArrVal_1074 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (+ |c_ULTIMATE.start_remove_~x#1.offset| 4)) v_ArrVal_1074) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0))) is different from false [2022-07-12 18:59:30,829 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1074 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) v_ArrVal_1074) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) v_ArrVal_1075) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0))) is different from false [2022-07-12 18:59:30,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739220755] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:30,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:59:30,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-07-12 18:59:30,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144339775] [2022-07-12 18:59:30,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:30,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 18:59:30,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:30,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 18:59:30,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=323, Unknown=3, NotChecked=114, Total=506 [2022-07-12 18:59:30,853 INFO L87 Difference]: Start difference. First operand 330 states and 426 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:59:31,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:31,563 INFO L93 Difference]: Finished difference Result 384 states and 487 transitions. [2022-07-12 18:59:31,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:59:31,564 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2022-07-12 18:59:31,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:31,565 INFO L225 Difference]: With dead ends: 384 [2022-07-12 18:59:31,565 INFO L226 Difference]: Without dead ends: 384 [2022-07-12 18:59:31,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=757, Unknown=3, NotChecked=180, Total=1122 [2022-07-12 18:59:31,566 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 329 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:31,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 878 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 634 Invalid, 0 Unknown, 84 Unchecked, 0.4s Time] [2022-07-12 18:59:31,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-07-12 18:59:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 320. [2022-07-12 18:59:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 248 states have (on average 1.3266129032258065) internal successors, (329), 277 states have internal predecessors, (329), 38 states have call successors, (38), 14 states have call predecessors, (38), 17 states have return successors, (44), 28 states have call predecessors, (44), 38 states have call successors, (44) [2022-07-12 18:59:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 411 transitions. [2022-07-12 18:59:31,579 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 411 transitions. Word has length 31 [2022-07-12 18:59:31,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:31,579 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 411 transitions. [2022-07-12 18:59:31,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:59:31,579 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 411 transitions. [2022-07-12 18:59:31,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 18:59:31,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:31,580 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:31,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:31,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-12 18:59:31,781 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:31,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:31,781 INFO L85 PathProgramCache]: Analyzing trace with hash -575773780, now seen corresponding path program 1 times [2022-07-12 18:59:31,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:31,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034120573] [2022-07-12 18:59:31,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:31,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:32,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:32,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034120573] [2022-07-12 18:59:32,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034120573] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:32,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702747736] [2022-07-12 18:59:32,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:32,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:32,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:32,135 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:59:32,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 18:59:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:32,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-12 18:59:32,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:32,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:59:32,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:59:32,347 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:59:32,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-12 18:59:32,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 18:59:32,363 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:59:32,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-12 18:59:32,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 18:59:32,426 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:59:32,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-12 18:59:32,442 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:59:32,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-12 18:59:32,462 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-12 18:59:32,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2022-07-12 18:59:32,480 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-12 18:59:32,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2022-07-12 18:59:32,589 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:59:32,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:59:32,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-07-12 18:59:32,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-07-12 18:59:32,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2022-07-12 18:59:32,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2022-07-12 18:59:32,828 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-12 18:59:32,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 43 [2022-07-12 18:59:32,843 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-12 18:59:32,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 49 [2022-07-12 18:59:34,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:59:34,056 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 18:59:34,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 41 [2022-07-12 18:59:34,063 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 18:59:34,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-12 18:59:34,091 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:34,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:34,636 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:34,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 239 [2022-07-12 18:59:34,643 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:34,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 199 [2022-07-12 18:59:44,277 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-07-12 18:59:44,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2022-07-12 18:59:44,281 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 18:59:44,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-12 18:59:44,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:44,482 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 53 more [2022-07-12 18:59:44,486 INFO L158 Benchmark]: Toolchain (without parser) took 53349.19ms. Allocated memory was 90.2MB in the beginning and 192.9MB in the end (delta: 102.8MB). Free memory was 57.9MB in the beginning and 57.5MB in the end (delta: 388.7kB). Peak memory consumption was 102.7MB. Max. memory is 16.1GB. [2022-07-12 18:59:44,486 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 90.2MB. Free memory was 45.5MB in the beginning and 45.5MB in the end (delta: 31.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:59:44,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.26ms. Allocated memory is still 90.2MB. Free memory was 57.5MB in the beginning and 58.0MB in the end (delta: -441.8kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 18:59:44,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.15ms. Allocated memory is still 90.2MB. Free memory was 58.0MB in the beginning and 55.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:59:44,486 INFO L158 Benchmark]: Boogie Preprocessor took 47.68ms. Allocated memory is still 90.2MB. Free memory was 55.7MB in the beginning and 54.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:59:44,486 INFO L158 Benchmark]: RCFGBuilder took 545.07ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 54.0MB in the beginning and 78.4MB in the end (delta: -24.3MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-07-12 18:59:44,486 INFO L158 Benchmark]: TraceAbstraction took 52158.60ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 77.7MB in the beginning and 57.5MB in the end (delta: 20.3MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. [2022-07-12 18:59:44,488 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 90.2MB. Free memory was 45.5MB in the beginning and 45.5MB in the end (delta: 31.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 530.26ms. Allocated memory is still 90.2MB. Free memory was 57.5MB in the beginning and 58.0MB in the end (delta: -441.8kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.15ms. Allocated memory is still 90.2MB. Free memory was 58.0MB in the beginning and 55.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.68ms. Allocated memory is still 90.2MB. Free memory was 55.7MB in the beginning and 54.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 545.07ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 54.0MB in the beginning and 78.4MB in the end (delta: -24.3MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 52158.60ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 77.7MB in the beginning and 57.5MB in the end (delta: 20.3MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/dancing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:59:46,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:59:46,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:59:46,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:59:46,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:59:46,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:59:46,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:59:46,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:59:46,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:59:46,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:59:46,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:59:46,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:59:46,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:59:46,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:59:46,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:59:46,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:59:46,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:59:46,242 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:59:46,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:59:46,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:59:46,249 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:59:46,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:59:46,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:59:46,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:59:46,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:59:46,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:59:46,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:59:46,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:59:46,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:59:46,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:59:46,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:59:46,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:59:46,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:59:46,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:59:46,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:59:46,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:59:46,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:59:46,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:59:46,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:59:46,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:59:46,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:59:46,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:59:46,276 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 18:59:46,306 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:59:46,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:59:46,307 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:59:46,307 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:59:46,308 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:59:46,308 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:59:46,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:59:46,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:59:46,309 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:59:46,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:59:46,310 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:59:46,321 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:59:46,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:59:46,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:59:46,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:59:46,322 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:59:46,323 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:59:46,323 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:59:46,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:59:46,323 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:59:46,324 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 18:59:46,324 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 18:59:46,324 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:59:46,324 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:59:46,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:59:46,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:59:46,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:59:46,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:59:46,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:59:46,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:59:46,326 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 18:59:46,326 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 18:59:46,327 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 18:59:46,327 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2022-07-12 18:59:46,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:59:46,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:59:46,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:59:46,677 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:59:46,678 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:59:46,679 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-12 18:59:46,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e27b530ab/a8c69594be7940eeabfad9a90758ec91/FLAG29292ebad [2022-07-12 18:59:47,210 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:59:47,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-12 18:59:47,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e27b530ab/a8c69594be7940eeabfad9a90758ec91/FLAG29292ebad [2022-07-12 18:59:47,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e27b530ab/a8c69594be7940eeabfad9a90758ec91 [2022-07-12 18:59:47,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:59:47,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:59:47,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:59:47,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:59:47,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:59:47,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:59:47" (1/1) ... [2022-07-12 18:59:47,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6148a8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:47, skipping insertion in model container [2022-07-12 18:59:47,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:59:47" (1/1) ... [2022-07-12 18:59:47,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:59:47,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:59:47,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-07-12 18:59:48,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:59:48,138 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:59:48,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-07-12 18:59:48,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:59:48,223 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:59:48,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:48 WrapperNode [2022-07-12 18:59:48,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:59:48,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:59:48,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:59:48,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:59:48,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:48" (1/1) ... [2022-07-12 18:59:48,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:48" (1/1) ... [2022-07-12 18:59:48,296 INFO L137 Inliner]: procedures = 125, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 91 [2022-07-12 18:59:48,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:59:48,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:59:48,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:59:48,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:59:48,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:48" (1/1) ... [2022-07-12 18:59:48,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:48" (1/1) ... [2022-07-12 18:59:48,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:48" (1/1) ... [2022-07-12 18:59:48,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:48" (1/1) ... [2022-07-12 18:59:48,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:48" (1/1) ... [2022-07-12 18:59:48,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:48" (1/1) ... [2022-07-12 18:59:48,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:48" (1/1) ... [2022-07-12 18:59:48,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:59:48,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:59:48,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:59:48,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:59:48,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:48" (1/1) ... [2022-07-12 18:59:48,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:59:48,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:48,392 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 18:59:48,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 18:59:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-07-12 18:59:48,432 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-07-12 18:59:48,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 18:59:48,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 18:59:48,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:59:48,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:59:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 18:59:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:59:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:59:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:59:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 18:59:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:59:48,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:59:48,579 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:59:48,595 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:59:48,976 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:59:48,983 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:59:48,983 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 18:59:48,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:59:48 BoogieIcfgContainer [2022-07-12 18:59:48,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:59:48,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:59:48,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:59:48,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:59:48,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:59:47" (1/3) ... [2022-07-12 18:59:48,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146a4612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:59:48, skipping insertion in model container [2022-07-12 18:59:48,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:48" (2/3) ... [2022-07-12 18:59:48,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146a4612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:59:48, skipping insertion in model container [2022-07-12 18:59:48,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:59:48" (3/3) ... [2022-07-12 18:59:49,002 INFO L111 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-07-12 18:59:49,014 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:59:49,014 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2022-07-12 18:59:49,050 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:59:49,056 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@44eaa03, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50bbe052 [2022-07-12 18:59:49,056 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2022-07-12 18:59:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 55 states have (on average 2.036363636363636) internal successors, (112), 99 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 18:59:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:59:49,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:49,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:59:49,065 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:49,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:49,070 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 18:59:49,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:59:49,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327859708] [2022-07-12 18:59:49,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:49,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:59:49,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:59:49,082 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:59:49,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 18:59:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:49,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:59:49,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:49,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:59:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:49,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:59:49,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:59:49,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327859708] [2022-07-12 18:59:49,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327859708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:49,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:49,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:59:49,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701998985] [2022-07-12 18:59:49,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:49,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:59:49,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:59:49,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:59:49,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:49,337 INFO L87 Difference]: Start difference. First operand has 108 states, 55 states have (on average 2.036363636363636) internal successors, (112), 99 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:49,504 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-07-12 18:59:49,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:59:49,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-12 18:59:49,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:49,513 INFO L225 Difference]: With dead ends: 106 [2022-07-12 18:59:49,514 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 18:59:49,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:49,518 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 82 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:49,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 94 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 18:59:49,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-12 18:59:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 95 states have internal predecessors, (105), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 18:59:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2022-07-12 18:59:49,553 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 3 [2022-07-12 18:59:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:49,553 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2022-07-12 18:59:49,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-07-12 18:59:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:59:49,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:49,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:59:49,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:49,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:59:49,760 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:49,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:49,761 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 18:59:49,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:59:49,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717954075] [2022-07-12 18:59:49,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:49,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:59:49,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:59:49,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:59:49,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 18:59:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:49,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:59:49,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:49,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:59:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:49,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:59:49,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:59:49,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717954075] [2022-07-12 18:59:49,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717954075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:49,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:49,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:59:49,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309818822] [2022-07-12 18:59:49,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:49,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:59:49,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:59:49,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:59:49,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:49,850 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:50,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:50,063 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-07-12 18:59:50,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:59:50,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-12 18:59:50,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:50,066 INFO L225 Difference]: With dead ends: 102 [2022-07-12 18:59:50,066 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 18:59:50,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:50,067 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:50,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 92 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:50,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 18:59:50,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-12 18:59:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 93 states have internal predecessors, (103), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 18:59:50,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2022-07-12 18:59:50,084 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 3 [2022-07-12 18:59:50,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:50,084 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2022-07-12 18:59:50,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2022-07-12 18:59:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:59:50,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:50,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:50,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:50,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:59:50,294 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:50,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:50,295 INFO L85 PathProgramCache]: Analyzing trace with hash 59267633, now seen corresponding path program 1 times [2022-07-12 18:59:50,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:59:50,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353849681] [2022-07-12 18:59:50,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:50,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:59:50,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:59:50,297 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:59:50,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 18:59:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:50,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:59:50,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:50,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:59:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:50,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:59:50,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:59:50,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353849681] [2022-07-12 18:59:50,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353849681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:50,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:50,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:59:50,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187537207] [2022-07-12 18:59:50,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:50,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:59:50,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:59:50,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:59:50,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:50,401 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:50,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:50,598 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2022-07-12 18:59:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:59:50,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 18:59:50,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:50,601 INFO L225 Difference]: With dead ends: 165 [2022-07-12 18:59:50,601 INFO L226 Difference]: Without dead ends: 165 [2022-07-12 18:59:50,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:50,602 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 74 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:50,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 213 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-12 18:59:50,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 100. [2022-07-12 18:59:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 91 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 18:59:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-07-12 18:59:50,612 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 8 [2022-07-12 18:59:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:50,613 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-07-12 18:59:50,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2022-07-12 18:59:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:59:50,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:50,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:50,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:50,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:59:50,824 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:50,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash 59267634, now seen corresponding path program 1 times [2022-07-12 18:59:50,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:59:50,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044379216] [2022-07-12 18:59:50,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:50,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:59:50,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:59:50,827 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:59:50,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 18:59:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:50,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:59:50,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:50,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:59:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:50,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:59:50,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:59:50,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044379216] [2022-07-12 18:59:50,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044379216] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:50,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:50,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:59:50,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529353809] [2022-07-12 18:59:50,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:50,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:59:50,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:59:50,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:59:50,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:50,921 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:51,182 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2022-07-12 18:59:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:59:51,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 18:59:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:51,184 INFO L225 Difference]: With dead ends: 165 [2022-07-12 18:59:51,184 INFO L226 Difference]: Without dead ends: 165 [2022-07-12 18:59:51,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:51,185 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 74 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:51,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 217 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:51,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-12 18:59:51,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 98. [2022-07-12 18:59:51,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 89 states have internal predecessors, (99), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 18:59:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-07-12 18:59:51,192 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 8 [2022-07-12 18:59:51,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:51,193 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-07-12 18:59:51,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-07-12 18:59:51,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:59:51,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:51,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:51,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:51,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:59:51,394 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:51,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:51,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1124238034, now seen corresponding path program 1 times [2022-07-12 18:59:51,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:59:51,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720126] [2022-07-12 18:59:51,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:51,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:59:51,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:59:51,397 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:59:51,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 18:59:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:51,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:59:51,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:51,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:59:51,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:59:51,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720126] [2022-07-12 18:59:51,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720126] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:51,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:51,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:59:51,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945658513] [2022-07-12 18:59:51,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:51,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:59:51,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:59:51,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:59:51,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:59:51,526 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:51,685 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2022-07-12 18:59:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:59:51,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 18:59:51,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:51,686 INFO L225 Difference]: With dead ends: 174 [2022-07-12 18:59:51,686 INFO L226 Difference]: Without dead ends: 174 [2022-07-12 18:59:51,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:59:51,687 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 225 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:51,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 393 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:51,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-12 18:59:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 142. [2022-07-12 18:59:51,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.89247311827957) internal successors, (176), 129 states have internal predecessors, (176), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 18:59:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 196 transitions. [2022-07-12 18:59:51,696 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 196 transitions. Word has length 10 [2022-07-12 18:59:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:51,697 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 196 transitions. [2022-07-12 18:59:51,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 196 transitions. [2022-07-12 18:59:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:59:51,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:51,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:51,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:51,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:59:51,909 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:51,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:51,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1121620373, now seen corresponding path program 1 times [2022-07-12 18:59:51,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:59:51,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100582027] [2022-07-12 18:59:51,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:51,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:59:51,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:59:51,912 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:59:51,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 18:59:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:52,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:59:52,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:52,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:59:52,062 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:59:52,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 18:59:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:52,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:59:52,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:59:52,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100582027] [2022-07-12 18:59:52,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100582027] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:52,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:52,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:59:52,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425867143] [2022-07-12 18:59:52,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:52,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:59:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:59:52,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:59:52,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:59:52,103 INFO L87 Difference]: Start difference. First operand 142 states and 196 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:52,297 INFO L93 Difference]: Finished difference Result 141 states and 194 transitions. [2022-07-12 18:59:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:59:52,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 18:59:52,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:52,300 INFO L225 Difference]: With dead ends: 141 [2022-07-12 18:59:52,300 INFO L226 Difference]: Without dead ends: 141 [2022-07-12 18:59:52,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:52,301 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 143 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:52,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 105 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-12 18:59:52,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-07-12 18:59:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 93 states have (on average 1.8709677419354838) internal successors, (174), 128 states have internal predecessors, (174), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 18:59:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 194 transitions. [2022-07-12 18:59:52,308 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 194 transitions. Word has length 10 [2022-07-12 18:59:52,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:52,308 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 194 transitions. [2022-07-12 18:59:52,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 194 transitions. [2022-07-12 18:59:52,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:59:52,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:52,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:52,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:52,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:59:52,519 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:52,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:52,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1121620372, now seen corresponding path program 1 times [2022-07-12 18:59:52,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:59:52,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754307497] [2022-07-12 18:59:52,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:52,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:59:52,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:59:52,521 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:59:52,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 18:59:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:52,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:59:52,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:52,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:59:52,627 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 18:59:52,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-12 18:59:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:52,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:59:52,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:59:52,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754307497] [2022-07-12 18:59:52,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754307497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:52,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:52,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:59:52,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809758092] [2022-07-12 18:59:52,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:52,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:59:52,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:59:52,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:59:52,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:59:52,656 INFO L87 Difference]: Start difference. First operand 141 states and 194 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:52,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:52,813 INFO L93 Difference]: Finished difference Result 140 states and 192 transitions. [2022-07-12 18:59:52,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:59:52,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 18:59:52,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:52,815 INFO L225 Difference]: With dead ends: 140 [2022-07-12 18:59:52,815 INFO L226 Difference]: Without dead ends: 140 [2022-07-12 18:59:52,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:52,816 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 140 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:52,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 104 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-12 18:59:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-07-12 18:59:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 127 states have internal predecessors, (172), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 18:59:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2022-07-12 18:59:52,822 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 10 [2022-07-12 18:59:52,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:52,822 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2022-07-12 18:59:52,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2022-07-12 18:59:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:59:52,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:52,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:52,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:53,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:59:53,028 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:53,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1910990355, now seen corresponding path program 1 times [2022-07-12 18:59:53,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:59:53,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359610941] [2022-07-12 18:59:53,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:53,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:59:53,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:59:53,030 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:59:53,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 18:59:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:53,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:59:53,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:53,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:59:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:53,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:59:53,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:59:53,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359610941] [2022-07-12 18:59:53,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359610941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:53,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:53,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:59:53,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462552076] [2022-07-12 18:59:53,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:53,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:59:53,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:59:53,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:59:53,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:59:53,169 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:53,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:53,595 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2022-07-12 18:59:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:59:53,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-12 18:59:53,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:53,596 INFO L225 Difference]: With dead ends: 163 [2022-07-12 18:59:53,597 INFO L226 Difference]: Without dead ends: 163 [2022-07-12 18:59:53,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:59:53,597 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 246 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:53,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 231 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 211 Invalid, 0 Unknown, 19 Unchecked, 0.4s Time] [2022-07-12 18:59:53,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-12 18:59:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 139. [2022-07-12 18:59:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 96 states have (on average 1.7083333333333333) internal successors, (164), 125 states have internal predecessors, (164), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 18:59:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 184 transitions. [2022-07-12 18:59:53,603 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 184 transitions. Word has length 15 [2022-07-12 18:59:53,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:53,604 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 184 transitions. [2022-07-12 18:59:53,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:53,604 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 184 transitions. [2022-07-12 18:59:53,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:59:53,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:53,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:53,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:53,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:59:53,812 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:53,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:53,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1910990356, now seen corresponding path program 1 times [2022-07-12 18:59:53,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:59:53,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187319395] [2022-07-12 18:59:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:53,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:59:53,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:59:53,814 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:59:53,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 18:59:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:53,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:59:53,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:53,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:59:53,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:53,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:59:53,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:59:53,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187319395] [2022-07-12 18:59:53,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187319395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:53,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:53,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:59:53,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947079109] [2022-07-12 18:59:53,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:53,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:59:53,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:59:53,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:59:53,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:59:53,977 INFO L87 Difference]: Start difference. First operand 139 states and 184 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:54,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:54,423 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2022-07-12 18:59:54,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:59:54,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-12 18:59:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:54,425 INFO L225 Difference]: With dead ends: 159 [2022-07-12 18:59:54,425 INFO L226 Difference]: Without dead ends: 159 [2022-07-12 18:59:54,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:59:54,426 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 186 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:54,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 261 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 225 Invalid, 0 Unknown, 17 Unchecked, 0.4s Time] [2022-07-12 18:59:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-12 18:59:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 139. [2022-07-12 18:59:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 96 states have (on average 1.6458333333333333) internal successors, (158), 125 states have internal predecessors, (158), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 18:59:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 178 transitions. [2022-07-12 18:59:54,431 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 178 transitions. Word has length 15 [2022-07-12 18:59:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:54,432 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 178 transitions. [2022-07-12 18:59:54,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 178 transitions. [2022-07-12 18:59:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:59:54,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:54,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:54,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:54,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:59:54,634 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:54,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:54,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148901, now seen corresponding path program 1 times [2022-07-12 18:59:54,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:59:54,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005077118] [2022-07-12 18:59:54,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:54,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:59:54,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:59:54,636 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:59:54,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 18:59:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:54,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 18:59:54,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:54,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:54,773 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 18:59:54,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-07-12 18:59:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:54,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:59:54,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005077118] [2022-07-12 18:59:54,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005077118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:59:54,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:59:54,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-12 18:59:54,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631077943] [2022-07-12 18:59:54,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:54,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:59:54,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:59:54,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:59:54,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:59:54,788 INFO L87 Difference]: Start difference. First operand 139 states and 178 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:55,060 INFO L93 Difference]: Finished difference Result 151 states and 193 transitions. [2022-07-12 18:59:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:59:55,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:59:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:55,062 INFO L225 Difference]: With dead ends: 151 [2022-07-12 18:59:55,062 INFO L226 Difference]: Without dead ends: 151 [2022-07-12 18:59:55,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:59:55,063 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 155 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:55,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 186 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:59:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-12 18:59:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2022-07-12 18:59:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 103 states have (on average 1.6310679611650485) internal successors, (168), 131 states have internal predecessors, (168), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-12 18:59:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2022-07-12 18:59:55,069 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 16 [2022-07-12 18:59:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:55,069 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2022-07-12 18:59:55,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2022-07-12 18:59:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:59:55,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:55,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:55,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:55,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:59:55,279 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:55,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:55,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148902, now seen corresponding path program 1 times [2022-07-12 18:59:55,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:59:55,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309098383] [2022-07-12 18:59:55,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:55,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:59:55,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:59:55,285 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:59:55,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 18:59:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:55,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 18:59:55,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:55,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:55,652 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:55,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-07-12 18:59:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:55,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:59:55,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309098383] [2022-07-12 18:59:55,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309098383] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:59:55,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:59:55,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-12 18:59:55,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610521001] [2022-07-12 18:59:55,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:55,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:59:55,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:59:55,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:59:55,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:59:55,833 INFO L87 Difference]: Start difference. First operand 147 states and 190 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:56,618 INFO L93 Difference]: Finished difference Result 148 states and 190 transitions. [2022-07-12 18:59:56,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:59:56,619 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:59:56,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:56,620 INFO L225 Difference]: With dead ends: 148 [2022-07-12 18:59:56,620 INFO L226 Difference]: Without dead ends: 148 [2022-07-12 18:59:56,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:59:56,621 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 288 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:56,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 258 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 18:59:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-12 18:59:56,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2022-07-12 18:59:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 103 states have (on average 1.6019417475728155) internal successors, (165), 130 states have internal predecessors, (165), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-12 18:59:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 187 transitions. [2022-07-12 18:59:56,625 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 187 transitions. Word has length 16 [2022-07-12 18:59:56,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:56,626 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 187 transitions. [2022-07-12 18:59:56,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:59:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 187 transitions. [2022-07-12 18:59:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 18:59:56,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:56,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:56,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:56,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:59:56,834 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:56,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:56,835 INFO L85 PathProgramCache]: Analyzing trace with hash -992190633, now seen corresponding path program 1 times [2022-07-12 18:59:56,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:59:56,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909128321] [2022-07-12 18:59:56,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:56,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:59:56,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:59:56,836 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:59:56,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 18:59:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:56,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 18:59:56,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:56,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:59:56,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:59:57,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 18:59:57,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 18:59:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:57,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:59:57,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:59:57,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909128321] [2022-07-12 18:59:57,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909128321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:57,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:57,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:59:57,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930279261] [2022-07-12 18:59:57,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:57,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:59:57,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:59:57,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:59:57,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:59:57,113 INFO L87 Difference]: Start difference. First operand 146 states and 187 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:57,282 INFO L93 Difference]: Finished difference Result 159 states and 202 transitions. [2022-07-12 18:59:57,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:59:57,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-12 18:59:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:57,284 INFO L225 Difference]: With dead ends: 159 [2022-07-12 18:59:57,284 INFO L226 Difference]: Without dead ends: 159 [2022-07-12 18:59:57,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:59:57,285 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 15 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:57,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 356 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-07-12 18:59:57,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-12 18:59:57,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2022-07-12 18:59:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.5663716814159292) internal successors, (177), 140 states have internal predecessors, (177), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-12 18:59:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 201 transitions. [2022-07-12 18:59:57,290 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 201 transitions. Word has length 19 [2022-07-12 18:59:57,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:57,291 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 201 transitions. [2022-07-12 18:59:57,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 201 transitions. [2022-07-12 18:59:57,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:59:57,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:57,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:57,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:57,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:59:57,500 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:57,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:57,501 INFO L85 PathProgramCache]: Analyzing trace with hash 343557913, now seen corresponding path program 1 times [2022-07-12 18:59:57,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:59:57,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897300237] [2022-07-12 18:59:57,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:57,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:59:57,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:59:57,502 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:59:57,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 18:59:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:57,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 18:59:57,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:57,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:59:57,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:59:57,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:57,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:59:57,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:57,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:59:57,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:59:57,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:59:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:57,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:59:57,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:59:57,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897300237] [2022-07-12 18:59:57,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897300237] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:57,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:57,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:59:57,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962040704] [2022-07-12 18:59:57,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:57,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:59:57,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:59:57,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:59:57,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:59:57,783 INFO L87 Difference]: Start difference. First operand 158 states and 201 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:57,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:57,909 INFO L93 Difference]: Finished difference Result 193 states and 243 transitions. [2022-07-12 18:59:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:59:57,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-12 18:59:57,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:57,911 INFO L225 Difference]: With dead ends: 193 [2022-07-12 18:59:57,911 INFO L226 Difference]: Without dead ends: 193 [2022-07-12 18:59:57,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:59:57,912 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 92 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:57,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 458 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2022-07-12 18:59:57,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-12 18:59:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 160. [2022-07-12 18:59:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 115 states have (on average 1.5565217391304347) internal successors, (179), 142 states have internal predecessors, (179), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-12 18:59:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 203 transitions. [2022-07-12 18:59:57,917 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 203 transitions. Word has length 21 [2022-07-12 18:59:57,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:57,918 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 203 transitions. [2022-07-12 18:59:57,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:59:57,918 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 203 transitions. [2022-07-12 18:59:57,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:59:57,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:57,919 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] [2022-07-12 18:59:57,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:58,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:59:58,120 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 18:59:58,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash 451808416, now seen corresponding path program 1 times [2022-07-12 18:59:58,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:59:58,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812666556] [2022-07-12 18:59:58,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:58,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:59:58,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:59:58,122 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:59:58,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 18:59:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:58,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 18:59:58,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:58,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:59:58,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:59:58,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 18:59:58,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 18:59:58,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:58,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:58,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-07-12 18:59:58,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:58,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:58,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:59:58,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812666556] [2022-07-12 18:59:58,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812666556] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:59:58,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:59:58,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2022-07-12 18:59:58,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693070951] [2022-07-12 18:59:58,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:58,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 18:59:58,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:59:58,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 18:59:58,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:59:58,782 INFO L87 Difference]: Start difference. First operand 160 states and 203 transitions. Second operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:00:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:01,094 INFO L93 Difference]: Finished difference Result 417 states and 537 transitions. [2022-07-12 19:00:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:00:01,095 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 19:00:01,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:01,097 INFO L225 Difference]: With dead ends: 417 [2022-07-12 19:00:01,098 INFO L226 Difference]: Without dead ends: 417 [2022-07-12 19:00:01,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-07-12 19:00:01,098 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 400 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:01,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1726 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 19:00:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-07-12 19:00:01,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 195. [2022-07-12 19:00:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 143 states have (on average 1.5594405594405594) internal successors, (223), 171 states have internal predecessors, (223), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-12 19:00:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 257 transitions. [2022-07-12 19:00:01,109 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 257 transitions. Word has length 22 [2022-07-12 19:00:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:01,110 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 257 transitions. [2022-07-12 19:00:01,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:00:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 257 transitions. [2022-07-12 19:00:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:00:01,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:01,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:01,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:01,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:01,320 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:01,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:01,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1286860128, now seen corresponding path program 1 times [2022-07-12 19:00:01,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:01,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756873783] [2022-07-12 19:00:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:01,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:01,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:01,322 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:01,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 19:00:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:01,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 19:00:01,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:01,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:01,422 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:00:01,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:00:01,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:01,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:01,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:01,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756873783] [2022-07-12 19:00:01,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756873783] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:00:01,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:01,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-07-12 19:00:01,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860261151] [2022-07-12 19:00:01,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:01,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:00:01,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:01,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:00:01,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:00:01,552 INFO L87 Difference]: Start difference. First operand 195 states and 257 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:00:02,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:02,165 INFO L93 Difference]: Finished difference Result 259 states and 313 transitions. [2022-07-12 19:00:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:00:02,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-12 19:00:02,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:02,167 INFO L225 Difference]: With dead ends: 259 [2022-07-12 19:00:02,167 INFO L226 Difference]: Without dead ends: 255 [2022-07-12 19:00:02,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:00:02,168 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 241 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:02,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 412 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 19:00:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-12 19:00:02,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 195. [2022-07-12 19:00:02,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 143 states have (on average 1.5454545454545454) internal successors, (221), 171 states have internal predecessors, (221), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-12 19:00:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 255 transitions. [2022-07-12 19:00:02,175 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 255 transitions. Word has length 21 [2022-07-12 19:00:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:02,175 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 255 transitions. [2022-07-12 19:00:02,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:00:02,176 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 255 transitions. [2022-07-12 19:00:02,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 19:00:02,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:02,176 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] [2022-07-12 19:00:02,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-12 19:00:02,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:02,386 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:02,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:02,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1821114983, now seen corresponding path program 1 times [2022-07-12 19:00:02,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:02,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366499858] [2022-07-12 19:00:02,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:02,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:02,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:02,388 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:02,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 19:00:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:02,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:00:02,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:02,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:00:02,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:02,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366499858] [2022-07-12 19:00:02,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366499858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:00:02,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:00:02,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:00:02,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419961881] [2022-07-12 19:00:02,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:00:02,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:00:02,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:02,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:00:02,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:00:02,535 INFO L87 Difference]: Start difference. First operand 195 states and 255 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:00:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:02,621 INFO L93 Difference]: Finished difference Result 219 states and 263 transitions. [2022-07-12 19:00:02,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:00:02,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-07-12 19:00:02,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:02,622 INFO L225 Difference]: With dead ends: 219 [2022-07-12 19:00:02,623 INFO L226 Difference]: Without dead ends: 219 [2022-07-12 19:00:02,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:00:02,623 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 53 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:02,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 466 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:00:02,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-12 19:00:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2022-07-12 19:00:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 175 states have internal predecessors, (222), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 14 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-12 19:00:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 258 transitions. [2022-07-12 19:00:02,634 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 258 transitions. Word has length 24 [2022-07-12 19:00:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:02,634 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 258 transitions. [2022-07-12 19:00:02,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:00:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 258 transitions. [2022-07-12 19:00:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 19:00:02,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:02,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:02,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:02,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:02,837 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:02,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1983275188, now seen corresponding path program 1 times [2022-07-12 19:00:02,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:02,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459492567] [2022-07-12 19:00:02,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:02,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:02,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:02,839 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:02,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 19:00:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:02,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 19:00:02,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:02,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:03,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:03,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:03,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2022-07-12 19:00:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:03,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:03,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459492567] [2022-07-12 19:00:03,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459492567] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:00:03,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:03,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-07-12 19:00:03,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734822977] [2022-07-12 19:00:03,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:03,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:00:03,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:03,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:00:03,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:00:03,276 INFO L87 Difference]: Start difference. First operand 199 states and 258 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:00:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:04,053 INFO L93 Difference]: Finished difference Result 311 states and 401 transitions. [2022-07-12 19:00:04,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:00:04,054 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-07-12 19:00:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:04,055 INFO L225 Difference]: With dead ends: 311 [2022-07-12 19:00:04,055 INFO L226 Difference]: Without dead ends: 305 [2022-07-12 19:00:04,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:00:04,056 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 199 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:04,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 818 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 313 Invalid, 0 Unknown, 171 Unchecked, 0.7s Time] [2022-07-12 19:00:04,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-07-12 19:00:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 218. [2022-07-12 19:00:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 159 states have (on average 1.509433962264151) internal successors, (240), 191 states have internal predecessors, (240), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (24), 16 states have call predecessors, (24), 22 states have call successors, (24) [2022-07-12 19:00:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 286 transitions. [2022-07-12 19:00:04,067 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 286 transitions. Word has length 23 [2022-07-12 19:00:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:04,067 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 286 transitions. [2022-07-12 19:00:04,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:00:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 286 transitions. [2022-07-12 19:00:04,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:00:04,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:04,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:04,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:04,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:04,282 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:04,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:04,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2147398490, now seen corresponding path program 1 times [2022-07-12 19:00:04,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:04,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956142835] [2022-07-12 19:00:04,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:04,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:04,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:04,285 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:04,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 19:00:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:04,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:00:04,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:04,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:04,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:04,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-12 19:00:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:04,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:04,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-07-12 19:00:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:04,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:04,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956142835] [2022-07-12 19:00:04,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956142835] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:00:04,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:04,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-07-12 19:00:04,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383451579] [2022-07-12 19:00:04,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:04,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:00:04,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:04,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:00:04,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:00:04,660 INFO L87 Difference]: Start difference. First operand 218 states and 286 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:00:05,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:05,169 INFO L93 Difference]: Finished difference Result 286 states and 362 transitions. [2022-07-12 19:00:05,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:00:05,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-12 19:00:05,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:05,171 INFO L225 Difference]: With dead ends: 286 [2022-07-12 19:00:05,171 INFO L226 Difference]: Without dead ends: 286 [2022-07-12 19:00:05,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:00:05,172 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 128 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:05,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 518 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 233 Invalid, 0 Unknown, 163 Unchecked, 0.5s Time] [2022-07-12 19:00:05,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-12 19:00:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 218. [2022-07-12 19:00:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 191 states have internal predecessors, (239), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (24), 16 states have call predecessors, (24), 22 states have call successors, (24) [2022-07-12 19:00:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 285 transitions. [2022-07-12 19:00:05,178 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 285 transitions. Word has length 25 [2022-07-12 19:00:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:05,181 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 285 transitions. [2022-07-12 19:00:05,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:00:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 285 transitions. [2022-07-12 19:00:05,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:00:05,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:05,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, 1, 1, 1] [2022-07-12 19:00:05,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:05,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:05,392 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:05,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:05,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2147398489, now seen corresponding path program 1 times [2022-07-12 19:00:05,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:05,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049430867] [2022-07-12 19:00:05,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:05,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:05,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:05,396 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:05,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-12 19:00:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:05,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 19:00:05,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:05,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:05,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:05,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:05,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-12 19:00:05,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 19:00:05,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:05,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:05,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2022-07-12 19:00:05,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:05,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:05,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:05,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:06,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:06,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049430867] [2022-07-12 19:00:06,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049430867] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:00:06,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:06,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2022-07-12 19:00:06,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939825440] [2022-07-12 19:00:06,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:06,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:00:06,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:06,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:00:06,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:00:06,043 INFO L87 Difference]: Start difference. First operand 218 states and 285 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:00:07,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:07,300 INFO L93 Difference]: Finished difference Result 289 states and 364 transitions. [2022-07-12 19:00:07,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:00:07,301 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-12 19:00:07,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:07,302 INFO L225 Difference]: With dead ends: 289 [2022-07-12 19:00:07,302 INFO L226 Difference]: Without dead ends: 289 [2022-07-12 19:00:07,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:00:07,303 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 172 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:07,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 564 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 340 Invalid, 0 Unknown, 72 Unchecked, 1.1s Time] [2022-07-12 19:00:07,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-12 19:00:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 218. [2022-07-12 19:00:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 191 states have internal predecessors, (238), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (24), 16 states have call predecessors, (24), 22 states have call successors, (24) [2022-07-12 19:00:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 284 transitions. [2022-07-12 19:00:07,310 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 284 transitions. Word has length 25 [2022-07-12 19:00:07,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:07,311 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 284 transitions. [2022-07-12 19:00:07,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:00:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 284 transitions. [2022-07-12 19:00:07,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 19:00:07,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:07,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:07,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:07,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:07,521 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:07,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:07,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1195361463, now seen corresponding path program 1 times [2022-07-12 19:00:07,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:07,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989714666] [2022-07-12 19:00:07,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:07,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:07,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:07,524 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:07,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 19:00:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:07,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:00:07,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:07,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:07,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:00:07,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:07,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989714666] [2022-07-12 19:00:07,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989714666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:00:07,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:00:07,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:00:07,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655273213] [2022-07-12 19:00:07,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:00:07,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:00:07,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:07,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:00:07,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:00:07,691 INFO L87 Difference]: Start difference. First operand 218 states and 284 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:00:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:08,033 INFO L93 Difference]: Finished difference Result 231 states and 281 transitions. [2022-07-12 19:00:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:00:08,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-07-12 19:00:08,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:08,035 INFO L225 Difference]: With dead ends: 231 [2022-07-12 19:00:08,035 INFO L226 Difference]: Without dead ends: 231 [2022-07-12 19:00:08,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:00:08,036 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 160 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:08,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 226 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 190 Invalid, 0 Unknown, 17 Unchecked, 0.3s Time] [2022-07-12 19:00:08,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-12 19:00:08,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 219. [2022-07-12 19:00:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 162 states have (on average 1.4320987654320987) internal successors, (232), 191 states have internal predecessors, (232), 22 states have call successors, (22), 11 states have call predecessors, (22), 11 states have return successors, (24), 16 states have call predecessors, (24), 22 states have call successors, (24) [2022-07-12 19:00:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 278 transitions. [2022-07-12 19:00:08,042 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 278 transitions. Word has length 27 [2022-07-12 19:00:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:08,042 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 278 transitions. [2022-07-12 19:00:08,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:00:08,042 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 278 transitions. [2022-07-12 19:00:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 19:00:08,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:08,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:08,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:08,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:08,243 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:08,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1195361464, now seen corresponding path program 1 times [2022-07-12 19:00:08,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:08,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577030795] [2022-07-12 19:00:08,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:08,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:08,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:08,245 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:08,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-12 19:00:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:08,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:00:08,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:08,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:08,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:00:08,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:08,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577030795] [2022-07-12 19:00:08,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577030795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:00:08,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:00:08,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:00:08,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157143716] [2022-07-12 19:00:08,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:00:08,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:00:08,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:08,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:00:08,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:00:08,457 INFO L87 Difference]: Start difference. First operand 219 states and 278 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:00:08,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:08,826 INFO L93 Difference]: Finished difference Result 229 states and 278 transitions. [2022-07-12 19:00:08,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:00:08,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-07-12 19:00:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:08,827 INFO L225 Difference]: With dead ends: 229 [2022-07-12 19:00:08,827 INFO L226 Difference]: Without dead ends: 229 [2022-07-12 19:00:08,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:00:08,828 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 137 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:08,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 224 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 206 Invalid, 0 Unknown, 15 Unchecked, 0.3s Time] [2022-07-12 19:00:08,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-12 19:00:08,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 219. [2022-07-12 19:00:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 162 states have (on average 1.4074074074074074) internal successors, (228), 191 states have internal predecessors, (228), 22 states have call successors, (22), 11 states have call predecessors, (22), 11 states have return successors, (24), 16 states have call predecessors, (24), 22 states have call successors, (24) [2022-07-12 19:00:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 274 transitions. [2022-07-12 19:00:08,835 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 274 transitions. Word has length 27 [2022-07-12 19:00:08,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:08,835 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 274 transitions. [2022-07-12 19:00:08,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:00:08,836 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 274 transitions. [2022-07-12 19:00:08,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:00:08,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:08,836 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:08,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:09,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:09,045 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:09,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:09,046 INFO L85 PathProgramCache]: Analyzing trace with hash -815173775, now seen corresponding path program 1 times [2022-07-12 19:00:09,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:09,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873533577] [2022-07-12 19:00:09,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:09,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:09,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:09,048 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:09,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 19:00:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:09,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:00:09,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:09,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:09,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:09,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-12 19:00:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:00:09,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:09,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-07-12 19:00:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:00:09,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:09,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873533577] [2022-07-12 19:00:09,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873533577] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:00:09,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:09,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2022-07-12 19:00:09,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879810871] [2022-07-12 19:00:09,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:09,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:00:09,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:09,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:00:09,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:00:09,463 INFO L87 Difference]: Start difference. First operand 219 states and 274 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:00:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:10,348 INFO L93 Difference]: Finished difference Result 313 states and 384 transitions. [2022-07-12 19:00:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:00:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 19:00:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:10,350 INFO L225 Difference]: With dead ends: 313 [2022-07-12 19:00:10,350 INFO L226 Difference]: Without dead ends: 311 [2022-07-12 19:00:10,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:00:10,351 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 250 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:10,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 614 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 570 Invalid, 0 Unknown, 49 Unchecked, 0.8s Time] [2022-07-12 19:00:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-07-12 19:00:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 231. [2022-07-12 19:00:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 171 states have (on average 1.4035087719298245) internal successors, (240), 200 states have internal predecessors, (240), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 18 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-12 19:00:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 288 transitions. [2022-07-12 19:00:10,358 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 288 transitions. Word has length 28 [2022-07-12 19:00:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:10,358 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 288 transitions. [2022-07-12 19:00:10,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:00:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 288 transitions. [2022-07-12 19:00:10,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:00:10,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:10,359 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:10,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:10,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:10,569 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:10,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash -815173774, now seen corresponding path program 1 times [2022-07-12 19:00:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:10,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155123949] [2022-07-12 19:00:10,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:10,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:10,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:10,571 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:10,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-12 19:00:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:10,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 19:00:10,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:10,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:10,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:10,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:10,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-12 19:00:10,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 19:00:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:00:10,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:11,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2022-07-12 19:00:11,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 106 [2022-07-12 19:00:11,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2022-07-12 19:00:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:00:11,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:11,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155123949] [2022-07-12 19:00:11,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155123949] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:00:11,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:11,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-07-12 19:00:11,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629743971] [2022-07-12 19:00:11,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:11,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 19:00:11,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:11,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 19:00:11,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:00:11,856 INFO L87 Difference]: Start difference. First operand 231 states and 288 transitions. Second operand has 17 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:00:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:14,056 INFO L93 Difference]: Finished difference Result 304 states and 374 transitions. [2022-07-12 19:00:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:00:14,057 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 19:00:14,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:14,060 INFO L225 Difference]: With dead ends: 304 [2022-07-12 19:00:14,060 INFO L226 Difference]: Without dead ends: 304 [2022-07-12 19:00:14,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-12 19:00:14,065 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 265 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:14,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 699 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 19:00:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-12 19:00:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 231. [2022-07-12 19:00:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 171 states have (on average 1.3976608187134503) internal successors, (239), 200 states have internal predecessors, (239), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 18 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-12 19:00:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 287 transitions. [2022-07-12 19:00:14,073 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 287 transitions. Word has length 28 [2022-07-12 19:00:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:14,074 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 287 transitions. [2022-07-12 19:00:14,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:00:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 287 transitions. [2022-07-12 19:00:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 19:00:14,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:14,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:14,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:14,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:14,285 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:14,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:14,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1709630296, now seen corresponding path program 1 times [2022-07-12 19:00:14,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:14,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233100101] [2022-07-12 19:00:14,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:14,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:14,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:14,287 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:14,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-12 19:00:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:14,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 19:00:14,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:14,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:14,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-12 19:00:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:14,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:14,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2022-07-12 19:00:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:14,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:14,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233100101] [2022-07-12 19:00:14,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233100101] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:00:14,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:14,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2022-07-12 19:00:14,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833706181] [2022-07-12 19:00:14,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:14,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:00:14,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:14,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:00:14,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:00:14,554 INFO L87 Difference]: Start difference. First operand 231 states and 287 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:00:14,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:14,834 INFO L93 Difference]: Finished difference Result 258 states and 317 transitions. [2022-07-12 19:00:14,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:00:14,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-07-12 19:00:14,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:14,836 INFO L225 Difference]: With dead ends: 258 [2022-07-12 19:00:14,836 INFO L226 Difference]: Without dead ends: 258 [2022-07-12 19:00:14,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:00:14,837 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 52 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:14,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 522 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 29 Unchecked, 0.2s Time] [2022-07-12 19:00:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-12 19:00:14,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 231. [2022-07-12 19:00:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 171 states have (on average 1.391812865497076) internal successors, (238), 200 states have internal predecessors, (238), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 18 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-12 19:00:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2022-07-12 19:00:14,843 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 286 transitions. Word has length 27 [2022-07-12 19:00:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:14,844 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 286 transitions. [2022-07-12 19:00:14,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:00:14,844 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 286 transitions. [2022-07-12 19:00:14,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:00:14,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:14,845 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] [2022-07-12 19:00:14,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:15,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:15,054 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:15,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:15,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1439567607, now seen corresponding path program 1 times [2022-07-12 19:00:15,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:15,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914665816] [2022-07-12 19:00:15,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:15,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:15,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:15,057 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:15,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-12 19:00:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:15,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 19:00:15,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:15,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:15,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:15,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 19:00:15,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 19:00:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:15,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:00:15,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:15,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914665816] [2022-07-12 19:00:15,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914665816] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:00:15,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:00:15,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:00:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758537141] [2022-07-12 19:00:15,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:00:15,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:00:15,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:15,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:00:15,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:00:15,389 INFO L87 Difference]: Start difference. First operand 231 states and 286 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:00:15,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:15,647 INFO L93 Difference]: Finished difference Result 255 states and 312 transitions. [2022-07-12 19:00:15,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:00:15,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-12 19:00:15,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:15,648 INFO L225 Difference]: With dead ends: 255 [2022-07-12 19:00:15,648 INFO L226 Difference]: Without dead ends: 255 [2022-07-12 19:00:15,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:00:15,649 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 37 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:15,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 382 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 25 Unchecked, 0.2s Time] [2022-07-12 19:00:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-12 19:00:15,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 241. [2022-07-12 19:00:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 179 states have (on average 1.3743016759776536) internal successors, (246), 208 states have internal predecessors, (246), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (25), 19 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-12 19:00:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 296 transitions. [2022-07-12 19:00:15,656 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 296 transitions. Word has length 30 [2022-07-12 19:00:15,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:15,656 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 296 transitions. [2022-07-12 19:00:15,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:00:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 296 transitions. [2022-07-12 19:00:15,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:00:15,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:15,657 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] [2022-07-12 19:00:15,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:15,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:15,866 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:15,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:15,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1096750777, now seen corresponding path program 1 times [2022-07-12 19:00:15,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:15,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163007929] [2022-07-12 19:00:15,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:15,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:15,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:15,869 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:15,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-12 19:00:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:15,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:00:15,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:15,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 19:00:16,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:00:16,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:16,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163007929] [2022-07-12 19:00:16,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163007929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:00:16,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:00:16,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:00:16,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959726642] [2022-07-12 19:00:16,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:00:16,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:00:16,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:16,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:00:16,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:00:16,058 INFO L87 Difference]: Start difference. First operand 241 states and 296 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:00:16,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:16,329 INFO L93 Difference]: Finished difference Result 304 states and 365 transitions. [2022-07-12 19:00:16,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:00:16,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-07-12 19:00:16,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:16,330 INFO L225 Difference]: With dead ends: 304 [2022-07-12 19:00:16,330 INFO L226 Difference]: Without dead ends: 304 [2022-07-12 19:00:16,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:00:16,331 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 131 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:16,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 232 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 168 Invalid, 0 Unknown, 26 Unchecked, 0.3s Time] [2022-07-12 19:00:16,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-12 19:00:16,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 254. [2022-07-12 19:00:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 189 states have (on average 1.3492063492063493) internal successors, (255), 218 states have internal predecessors, (255), 26 states have call successors, (26), 15 states have call predecessors, (26), 15 states have return successors, (26), 20 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-12 19:00:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 307 transitions. [2022-07-12 19:00:16,337 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 307 transitions. Word has length 30 [2022-07-12 19:00:16,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:16,338 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 307 transitions. [2022-07-12 19:00:16,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:00:16,338 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 307 transitions. [2022-07-12 19:00:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:00:16,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:16,339 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] [2022-07-12 19:00:16,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:16,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:16,547 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:16,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:16,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1096750776, now seen corresponding path program 1 times [2022-07-12 19:00:16,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:16,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159277858] [2022-07-12 19:00:16,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:16,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:16,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:16,549 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:16,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-12 19:00:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:16,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:00:16,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:16,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 19:00:16,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:00:16,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:16,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159277858] [2022-07-12 19:00:16,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159277858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:00:16,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:00:16,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:00:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592575364] [2022-07-12 19:00:16,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:00:16,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:00:16,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:16,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:00:16,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:00:16,752 INFO L87 Difference]: Start difference. First operand 254 states and 307 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:00:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:16,897 INFO L93 Difference]: Finished difference Result 272 states and 327 transitions. [2022-07-12 19:00:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:00:16,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-07-12 19:00:16,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:16,899 INFO L225 Difference]: With dead ends: 272 [2022-07-12 19:00:16,899 INFO L226 Difference]: Without dead ends: 272 [2022-07-12 19:00:16,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:00:16,900 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 79 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:16,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 201 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 50 Unchecked, 0.1s Time] [2022-07-12 19:00:16,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-12 19:00:16,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 262. [2022-07-12 19:00:16,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 197 states have (on average 1.3401015228426396) internal successors, (264), 226 states have internal predecessors, (264), 26 states have call successors, (26), 15 states have call predecessors, (26), 15 states have return successors, (26), 20 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-12 19:00:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 316 transitions. [2022-07-12 19:00:16,906 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 316 transitions. Word has length 30 [2022-07-12 19:00:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:16,906 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 316 transitions. [2022-07-12 19:00:16,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:00:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 316 transitions. [2022-07-12 19:00:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 19:00:16,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:16,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:16,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:17,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:17,120 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:17,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:17,121 INFO L85 PathProgramCache]: Analyzing trace with hash 453625093, now seen corresponding path program 1 times [2022-07-12 19:00:17,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:17,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652917610] [2022-07-12 19:00:17,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:17,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:17,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:17,122 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:17,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-12 19:00:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:17,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:00:17,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:17,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:00:17,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:00:17,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:17,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:00:17,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:17,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652917610] [2022-07-12 19:00:17,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652917610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:00:17,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:00:17,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:00:17,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306911715] [2022-07-12 19:00:17,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:00:17,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:00:17,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:17,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:00:17,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:00:17,354 INFO L87 Difference]: Start difference. First operand 262 states and 316 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:00:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:17,700 INFO L93 Difference]: Finished difference Result 337 states and 403 transitions. [2022-07-12 19:00:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:00:17,701 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-07-12 19:00:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:17,702 INFO L225 Difference]: With dead ends: 337 [2022-07-12 19:00:17,702 INFO L226 Difference]: Without dead ends: 337 [2022-07-12 19:00:17,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:00:17,703 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 87 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:17,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 483 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 39 Unchecked, 0.3s Time] [2022-07-12 19:00:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-12 19:00:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 293. [2022-07-12 19:00:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 221 states have (on average 1.3257918552036199) internal successors, (293), 251 states have internal predecessors, (293), 30 states have call successors, (30), 18 states have call predecessors, (30), 18 states have return successors, (30), 23 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-12 19:00:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 353 transitions. [2022-07-12 19:00:17,710 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 353 transitions. Word has length 32 [2022-07-12 19:00:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:17,710 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 353 transitions. [2022-07-12 19:00:17,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:00:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 353 transitions. [2022-07-12 19:00:17,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 19:00:17,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:17,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:17,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:17,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:17,920 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:17,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:17,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1579548114, now seen corresponding path program 1 times [2022-07-12 19:00:17,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:17,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060434691] [2022-07-12 19:00:17,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:17,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:17,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:17,923 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:17,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-12 19:00:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:18,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 19:00:18,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:18,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:18,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:00:18,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:00:18,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:18,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:18,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:18,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:18,158 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:00:18,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:00:18,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:00:18,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:00:18,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:00:18,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:00:18,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:18,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:18,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:18,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:18,497 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:00:18,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-07-12 19:00:18,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 19:00:18,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:00:18,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:18,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 19:00:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:18,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:18,588 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_793) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_794) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|)))) is different from false [2022-07-12 19:00:18,629 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_794) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_793) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:00:18,669 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_793) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_794) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:00:18,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:18,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060434691] [2022-07-12 19:00:18,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060434691] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:00:18,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2097737678] [2022-07-12 19:00:18,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:18,715 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:00:18,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:00:18,747 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:00:18,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2022-07-12 19:00:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:18,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-12 19:00:18,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:19,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:00:19,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:00:19,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:19,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:19,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:19,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:19,239 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:00:19,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 19:00:19,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:00:19,267 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:00:19,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 19:00:19,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:00:19,361 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:00:19,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 19:00:19,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:00:19,412 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:00:19,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 19:00:19,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:00:19,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:19,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:19,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:19,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:20,159 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:00:20,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2022-07-12 19:00:20,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:20,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 19:00:20,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:00:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:20,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:20,297 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_854) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|))) (forall ((v_ArrVal_853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_853) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|)))) is different from false [2022-07-12 19:00:20,313 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_854) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_853) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:00:20,339 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_853) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_854) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:00:20,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2097737678] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:00:20,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:20,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2022-07-12 19:00:20,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365852872] [2022-07-12 19:00:20,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:20,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 19:00:20,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:20,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 19:00:20,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=396, Unknown=6, NotChecked=270, Total=756 [2022-07-12 19:00:20,365 INFO L87 Difference]: Start difference. First operand 293 states and 353 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:00:20,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:20,786 INFO L93 Difference]: Finished difference Result 329 states and 394 transitions. [2022-07-12 19:00:20,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:00:20,786 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2022-07-12 19:00:20,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:20,787 INFO L225 Difference]: With dead ends: 329 [2022-07-12 19:00:20,787 INFO L226 Difference]: Without dead ends: 329 [2022-07-12 19:00:20,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=118, Invalid=550, Unknown=6, NotChecked=318, Total=992 [2022-07-12 19:00:20,788 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 123 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:20,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 772 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 159 Invalid, 0 Unknown, 157 Unchecked, 0.3s Time] [2022-07-12 19:00:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-12 19:00:20,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 315. [2022-07-12 19:00:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 241 states have (on average 1.3070539419087137) internal successors, (315), 271 states have internal predecessors, (315), 31 states have call successors, (31), 19 states have call predecessors, (31), 19 states have return successors, (31), 24 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-12 19:00:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 377 transitions. [2022-07-12 19:00:20,795 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 377 transitions. Word has length 31 [2022-07-12 19:00:20,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:20,796 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 377 transitions. [2022-07-12 19:00:20,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:00:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 377 transitions. [2022-07-12 19:00:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:00:20,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:20,797 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:20,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:21,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2022-07-12 19:00:21,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 19:00:21,208 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:21,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:21,208 INFO L85 PathProgramCache]: Analyzing trace with hash -575773780, now seen corresponding path program 2 times [2022-07-12 19:00:21,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:21,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298894752] [2022-07-12 19:00:21,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:00:21,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:21,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:21,209 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:21,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-12 19:00:21,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:00:21,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:00:21,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 19:00:21,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:21,433 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:00:21,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:00:21,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:21,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:21,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:21,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-07-12 19:00:21,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:00:21,787 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-12 19:00:21,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2022-07-12 19:00:21,795 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:00:21,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-12 19:00:21,818 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:21,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:22,340 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:22,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2493 treesize of output 2242 [2022-07-12 19:00:22,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2616 treesize of output 2514 [2022-07-12 19:00:27,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 378 [2022-07-12 19:00:27,660 INFO L356 Elim1Store]: treesize reduction 425, result has 15.3 percent of original size [2022-07-12 19:00:27,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 5200 treesize of output 4874 [2022-07-12 19:00:28,798 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:28,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 90 [2022-07-12 19:00:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:28,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:28,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298894752] [2022-07-12 19:00:28,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298894752] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:00:28,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:28,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2022-07-12 19:00:28,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68301077] [2022-07-12 19:00:28,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:28,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 19:00:28,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:28,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 19:00:28,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-07-12 19:00:28,946 INFO L87 Difference]: Start difference. First operand 315 states and 377 transitions. Second operand has 24 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 20 states have internal predecessors, (56), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:00:31,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:31,165 INFO L93 Difference]: Finished difference Result 463 states and 560 transitions. [2022-07-12 19:00:31,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 19:00:31,166 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 20 states have internal predecessors, (56), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:00:31,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:31,167 INFO L225 Difference]: With dead ends: 463 [2022-07-12 19:00:31,168 INFO L226 Difference]: Without dead ends: 463 [2022-07-12 19:00:31,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-07-12 19:00:31,168 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 327 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:31,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1642 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1081 Invalid, 0 Unknown, 185 Unchecked, 1.9s Time] [2022-07-12 19:00:31,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-07-12 19:00:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 312. [2022-07-12 19:00:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 239 states have (on average 1.3054393305439331) internal successors, (312), 269 states have internal predecessors, (312), 30 states have call successors, (30), 19 states have call predecessors, (30), 19 states have return successors, (30), 23 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-12 19:00:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 372 transitions. [2022-07-12 19:00:31,182 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 372 transitions. Word has length 34 [2022-07-12 19:00:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:31,183 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 372 transitions. [2022-07-12 19:00:31,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 20 states have internal predecessors, (56), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:00:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 372 transitions. [2022-07-12 19:00:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:00:31,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:31,185 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] [2022-07-12 19:00:31,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-07-12 19:00:31,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:31,395 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:31,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:31,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1173956747, now seen corresponding path program 1 times [2022-07-12 19:00:31,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:31,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300450032] [2022-07-12 19:00:31,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:31,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:31,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:31,397 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:31,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-12 19:00:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:31,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-12 19:00:31,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:31,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:31,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:31,636 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:00:31,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-12 19:00:31,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:00:31,658 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:00:31,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-12 19:00:31,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:00:31,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:00:31,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:00:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:00:31,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:32,289 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:32,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-12 19:00:32,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-12 19:00:32,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:00:32,302 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 19:00:32,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-12 19:00:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:00:32,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:32,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300450032] [2022-07-12 19:00:32,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300450032] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:00:32,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:32,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-07-12 19:00:32,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453603802] [2022-07-12 19:00:32,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:32,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 19:00:32,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:32,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 19:00:32,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=1, NotChecked=0, Total=420 [2022-07-12 19:00:32,343 INFO L87 Difference]: Start difference. First operand 312 states and 372 transitions. Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:00:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:34,073 INFO L93 Difference]: Finished difference Result 341 states and 388 transitions. [2022-07-12 19:00:34,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 19:00:34,073 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-07-12 19:00:34,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:34,074 INFO L225 Difference]: With dead ends: 341 [2022-07-12 19:00:34,075 INFO L226 Difference]: Without dead ends: 341 [2022-07-12 19:00:34,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=178, Invalid=751, Unknown=1, NotChecked=0, Total=930 [2022-07-12 19:00:34,075 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 264 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:34,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1048 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 809 Invalid, 0 Unknown, 86 Unchecked, 1.1s Time] [2022-07-12 19:00:34,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-12 19:00:34,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 285. [2022-07-12 19:00:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 219 states have (on average 1.2602739726027397) internal successors, (276), 244 states have internal predecessors, (276), 27 states have call successors, (27), 19 states have call predecessors, (27), 19 states have return successors, (27), 21 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-12 19:00:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 330 transitions. [2022-07-12 19:00:34,085 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 330 transitions. Word has length 34 [2022-07-12 19:00:34,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:34,085 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 330 transitions. [2022-07-12 19:00:34,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:00:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 330 transitions. [2022-07-12 19:00:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:00:34,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:34,086 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] [2022-07-12 19:00:34,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:34,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:34,296 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:34,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:34,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1047948467, now seen corresponding path program 1 times [2022-07-12 19:00:34,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:34,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49621521] [2022-07-12 19:00:34,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:34,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:34,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:34,299 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:34,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-12 19:00:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:34,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 19:00:34,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:34,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:00:34,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:34,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:34,501 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:00:34,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-07-12 19:00:34,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-07-12 19:00:34,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-12 19:00:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:00:34,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:35,154 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-12 19:00:35,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 19:00:35,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:00:35,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:35,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-12 19:00:35,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-12 19:00:35,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:00:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:00:35,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:35,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49621521] [2022-07-12 19:00:35,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49621521] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:00:35,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:35,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2022-07-12 19:00:35,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69446148] [2022-07-12 19:00:35,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:35,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 19:00:35,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:35,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 19:00:35,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=428, Unknown=3, NotChecked=0, Total=506 [2022-07-12 19:00:35,263 INFO L87 Difference]: Start difference. First operand 285 states and 330 transitions. Second operand has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:00:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:36,208 INFO L93 Difference]: Finished difference Result 332 states and 373 transitions. [2022-07-12 19:00:36,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 19:00:36,209 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-07-12 19:00:36,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:36,210 INFO L225 Difference]: With dead ends: 332 [2022-07-12 19:00:36,210 INFO L226 Difference]: Without dead ends: 332 [2022-07-12 19:00:36,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=707, Unknown=3, NotChecked=0, Total=870 [2022-07-12 19:00:36,211 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 271 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:36,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 867 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 499 Invalid, 0 Unknown, 190 Unchecked, 0.7s Time] [2022-07-12 19:00:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-07-12 19:00:36,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 300. [2022-07-12 19:00:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 231 states have (on average 1.2467532467532467) internal successors, (288), 256 states have internal predecessors, (288), 28 states have call successors, (28), 21 states have call predecessors, (28), 21 states have return successors, (28), 22 states have call predecessors, (28), 28 states have call successors, (28) [2022-07-12 19:00:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 344 transitions. [2022-07-12 19:00:36,217 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 344 transitions. Word has length 36 [2022-07-12 19:00:36,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:36,217 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 344 transitions. [2022-07-12 19:00:36,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:00:36,217 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 344 transitions. [2022-07-12 19:00:36,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:00:36,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:36,218 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] [2022-07-12 19:00:36,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-07-12 19:00:36,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:36,427 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:36,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:36,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1047948466, now seen corresponding path program 1 times [2022-07-12 19:00:36,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:36,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548075538] [2022-07-12 19:00:36,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:36,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:36,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:36,429 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:36,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-12 19:00:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:36,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 19:00:36,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:36,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:00:36,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:00:36,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:36,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:36,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:36,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:36,669 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:00:36,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-07-12 19:00:36,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 19:00:36,695 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:00:36,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 19:00:36,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:00:37,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-12 19:00:37,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-12 19:00:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:00:37,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:37,802 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:37,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2022-07-12 19:00:38,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:00:38,433 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:38,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2022-07-12 19:00:38,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2022-07-12 19:00:38,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-07-12 19:00:38,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:00:38,459 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:38,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-12 19:00:38,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-12 19:00:38,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:00:38,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:00:38,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:38,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 40 [2022-07-12 19:00:38,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:00:38,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-12 19:00:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:00:38,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:38,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548075538] [2022-07-12 19:00:38,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548075538] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:00:38,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:38,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-07-12 19:00:38,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191195784] [2022-07-12 19:00:38,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:38,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 19:00:38,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:38,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 19:00:38,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=515, Unknown=3, NotChecked=0, Total=600 [2022-07-12 19:00:38,653 INFO L87 Difference]: Start difference. First operand 300 states and 344 transitions. Second operand has 25 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:00:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:41,158 INFO L93 Difference]: Finished difference Result 372 states and 425 transitions. [2022-07-12 19:00:41,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 19:00:41,158 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-07-12 19:00:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:41,159 INFO L225 Difference]: With dead ends: 372 [2022-07-12 19:00:41,159 INFO L226 Difference]: Without dead ends: 372 [2022-07-12 19:00:41,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=152, Invalid=837, Unknown=3, NotChecked=0, Total=992 [2022-07-12 19:00:41,160 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 578 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:41,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 974 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 770 Invalid, 0 Unknown, 205 Unchecked, 1.9s Time] [2022-07-12 19:00:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-07-12 19:00:41,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 301. [2022-07-12 19:00:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 232 states have (on average 1.2456896551724137) internal successors, (289), 257 states have internal predecessors, (289), 28 states have call successors, (28), 21 states have call predecessors, (28), 21 states have return successors, (28), 22 states have call predecessors, (28), 28 states have call successors, (28) [2022-07-12 19:00:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 345 transitions. [2022-07-12 19:00:41,173 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 345 transitions. Word has length 36 [2022-07-12 19:00:41,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:41,174 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 345 transitions. [2022-07-12 19:00:41,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:00:41,174 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 345 transitions. [2022-07-12 19:00:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:00:41,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:41,175 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:41,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:41,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:41,385 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:41,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:41,385 INFO L85 PathProgramCache]: Analyzing trace with hash 108587800, now seen corresponding path program 1 times [2022-07-12 19:00:41,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:41,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114575881] [2022-07-12 19:00:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:41,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:41,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:41,387 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:41,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-12 19:00:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:41,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 19:00:41,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:41,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:41,568 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:00:41,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:00:41,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:00:41,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:41,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2022-07-12 19:00:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:00:42,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:42,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114575881] [2022-07-12 19:00:42,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114575881] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:00:42,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:42,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2022-07-12 19:00:42,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045520579] [2022-07-12 19:00:42,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:42,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 19:00:42,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:42,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 19:00:42,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:00:42,090 INFO L87 Difference]: Start difference. First operand 301 states and 345 transitions. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 17 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:00:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:43,656 INFO L93 Difference]: Finished difference Result 404 states and 475 transitions. [2022-07-12 19:00:43,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:00:43,657 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 17 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-07-12 19:00:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:43,658 INFO L225 Difference]: With dead ends: 404 [2022-07-12 19:00:43,658 INFO L226 Difference]: Without dead ends: 404 [2022-07-12 19:00:43,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2022-07-12 19:00:43,659 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 305 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:43,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1052 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 925 Invalid, 0 Unknown, 183 Unchecked, 1.4s Time] [2022-07-12 19:00:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-07-12 19:00:43,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 338. [2022-07-12 19:00:43,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 260 states have (on average 1.2615384615384615) internal successors, (328), 289 states have internal predecessors, (328), 33 states have call successors, (33), 21 states have call predecessors, (33), 25 states have return successors, (38), 27 states have call predecessors, (38), 33 states have call successors, (38) [2022-07-12 19:00:43,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 399 transitions. [2022-07-12 19:00:43,668 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 399 transitions. Word has length 36 [2022-07-12 19:00:43,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:43,668 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 399 transitions. [2022-07-12 19:00:43,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 17 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:00:43,668 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 399 transitions. [2022-07-12 19:00:43,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:00:43,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:43,669 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:43,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:43,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:43,879 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:43,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:43,879 INFO L85 PathProgramCache]: Analyzing trace with hash 712532890, now seen corresponding path program 1 times [2022-07-12 19:00:43,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:43,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830040619] [2022-07-12 19:00:43,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:43,880 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:43,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:43,881 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:43,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-12 19:00:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:43,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:00:43,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:00:44,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:00:44,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:44,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830040619] [2022-07-12 19:00:44,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830040619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:00:44,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:00:44,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:00:44,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118863079] [2022-07-12 19:00:44,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:00:44,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:00:44,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:44,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:00:44,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:00:44,006 INFO L87 Difference]: Start difference. First operand 338 states and 399 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:00:44,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:44,037 INFO L93 Difference]: Finished difference Result 346 states and 408 transitions. [2022-07-12 19:00:44,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:00:44,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-07-12 19:00:44,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:44,039 INFO L225 Difference]: With dead ends: 346 [2022-07-12 19:00:44,039 INFO L226 Difference]: Without dead ends: 346 [2022-07-12 19:00:44,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:00:44,039 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 5 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:44,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 456 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:00:44,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-12 19:00:44,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 343. [2022-07-12 19:00:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 263 states have (on average 1.258555133079848) internal successors, (331), 292 states have internal predecessors, (331), 34 states have call successors, (34), 22 states have call predecessors, (34), 26 states have return successors, (39), 28 states have call predecessors, (39), 34 states have call successors, (39) [2022-07-12 19:00:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 404 transitions. [2022-07-12 19:00:44,047 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 404 transitions. Word has length 40 [2022-07-12 19:00:44,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:44,047 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 404 transitions. [2022-07-12 19:00:44,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:00:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 404 transitions. [2022-07-12 19:00:44,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 19:00:44,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:44,049 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:44,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2022-07-12 19:00:44,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:44,258 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:44,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1618735444, now seen corresponding path program 1 times [2022-07-12 19:00:44,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:44,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233628465] [2022-07-12 19:00:44,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:44,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:44,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:44,261 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:44,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-12 19:00:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:44,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:00:44,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 19:00:44,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:00:44,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:44,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233628465] [2022-07-12 19:00:44,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233628465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:00:44,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:00:44,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:00:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330846674] [2022-07-12 19:00:44,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:00:44,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:00:44,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:44,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:00:44,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:00:44,426 INFO L87 Difference]: Start difference. First operand 343 states and 404 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:00:44,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:44,448 INFO L93 Difference]: Finished difference Result 333 states and 381 transitions. [2022-07-12 19:00:44,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:00:44,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2022-07-12 19:00:44,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:44,450 INFO L225 Difference]: With dead ends: 333 [2022-07-12 19:00:44,450 INFO L226 Difference]: Without dead ends: 321 [2022-07-12 19:00:44,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:00:44,451 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:44,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 474 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:00:44,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-07-12 19:00:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 310. [2022-07-12 19:00:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 239 states have (on average 1.2384937238493723) internal successors, (296), 264 states have internal predecessors, (296), 29 states have call successors, (29), 22 states have call predecessors, (29), 22 states have return successors, (29), 23 states have call predecessors, (29), 29 states have call successors, (29) [2022-07-12 19:00:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 354 transitions. [2022-07-12 19:00:44,458 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 354 transitions. Word has length 38 [2022-07-12 19:00:44,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:44,458 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 354 transitions. [2022-07-12 19:00:44,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:00:44,459 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 354 transitions. [2022-07-12 19:00:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:00:44,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:44,459 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:44,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:44,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:44,669 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:44,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:44,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1368231683, now seen corresponding path program 2 times [2022-07-12 19:00:44,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:44,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644124998] [2022-07-12 19:00:44,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:00:44,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:44,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:44,671 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:44,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-07-12 19:00:44,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:00:44,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:00:44,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-12 19:00:44,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:44,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:44,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:00:44,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:00:44,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:44,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:44,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:44,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:44,937 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:00:44,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:00:44,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:00:44,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:00:44,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:00:45,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:00:45,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:45,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:45,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:45,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:45,063 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:00:45,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:00:45,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:00:45,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:00:45,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:00:45,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:00:45,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:45,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:45,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:45,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:45,331 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:00:45,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-07-12 19:00:45,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 19:00:45,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:00:45,361 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:45,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 19:00:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 19:00:45,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:45,427 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1250) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1251) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:00:45,446 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_1251) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_1250) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:00:45,467 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1250 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1250) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1251) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:00:45,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:45,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644124998] [2022-07-12 19:00:45,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644124998] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:00:45,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [568940605] [2022-07-12 19:00:45,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:00:45,485 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:00:45,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:00:45,487 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:00:45,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2022-07-12 19:00:45,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:00:45,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:00:45,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-12 19:00:45,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:45,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:00:45,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:00:45,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:45,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:45,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:45,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:45,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:45,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:00:45,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:45,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:00:45,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:45,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:00:46,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:46,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:00:46,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:46,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:46,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:46,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:46,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:46,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 19:00:46,227 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:00:46,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 19:00:46,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:00:46,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:46,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 19:00:46,343 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:00:46,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 19:00:46,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:00:46,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:46,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2022-07-12 19:00:46,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:46,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:00:47,274 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:00:47,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2022-07-12 19:00:47,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:47,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 19:00:47,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:00:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:47,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:47,395 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1338) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1336) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:00:47,411 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_1338) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_1336) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:00:47,435 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1336) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1338 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1338) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:00:47,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [568940605] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:00:47,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:47,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2022-07-12 19:00:47,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644062474] [2022-07-12 19:00:47,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:47,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 19:00:47,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:47,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 19:00:47,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=511, Unknown=6, NotChecked=306, Total=930 [2022-07-12 19:00:47,459 INFO L87 Difference]: Start difference. First operand 310 states and 354 transitions. Second operand has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:00:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:48,660 INFO L93 Difference]: Finished difference Result 345 states and 393 transitions. [2022-07-12 19:00:48,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 19:00:48,663 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-07-12 19:00:48,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:48,665 INFO L225 Difference]: With dead ends: 345 [2022-07-12 19:00:48,665 INFO L226 Difference]: Without dead ends: 345 [2022-07-12 19:00:48,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=185, Invalid=763, Unknown=6, NotChecked=378, Total=1332 [2022-07-12 19:00:48,666 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 251 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:48,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 750 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 317 Invalid, 0 Unknown, 132 Unchecked, 0.6s Time] [2022-07-12 19:00:48,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-07-12 19:00:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 273. [2022-07-12 19:00:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 207 states have (on average 1.2463768115942029) internal successors, (258), 231 states have internal predecessors, (258), 27 states have call successors, (27), 20 states have call predecessors, (27), 20 states have return successors, (27), 21 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-12 19:00:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 312 transitions. [2022-07-12 19:00:48,672 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 312 transitions. Word has length 37 [2022-07-12 19:00:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:48,672 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 312 transitions. [2022-07-12 19:00:48,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:00:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 312 transitions. [2022-07-12 19:00:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:00:48,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:48,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:48,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:48,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:49,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 19:00:49,087 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:49,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:49,088 INFO L85 PathProgramCache]: Analyzing trace with hash 318176130, now seen corresponding path program 1 times [2022-07-12 19:00:49,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:49,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219932037] [2022-07-12 19:00:49,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:49,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:49,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:49,089 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:49,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-07-12 19:00:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:49,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 19:00:49,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:49,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:49,279 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:00:49,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-12 19:00:49,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:49,511 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:00:49,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-12 19:00:49,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-12 19:00:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:49,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:49,828 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) v_ArrVal_1384) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-12 19:00:49,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:49,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219932037] [2022-07-12 19:00:49,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219932037] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:00:49,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1502489839] [2022-07-12 19:00:49,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:49,839 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:00:49,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:00:49,840 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:00:49,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2022-07-12 19:00:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:50,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 19:00:50,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:50,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:50,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:50,826 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:00:50,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-12 19:00:51,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-12 19:00:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:51,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:51,347 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1428 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1428) |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))))) is different from false [2022-07-12 19:00:51,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1502489839] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:00:51,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:51,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-07-12 19:00:51,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950001128] [2022-07-12 19:00:51,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:51,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 19:00:51,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:51,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 19:00:51,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=8, NotChecked=94, Total=702 [2022-07-12 19:00:51,416 INFO L87 Difference]: Start difference. First operand 273 states and 312 transitions. Second operand has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:00:52,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:52,355 INFO L93 Difference]: Finished difference Result 324 states and 370 transitions. [2022-07-12 19:00:52,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:00:52,356 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-07-12 19:00:52,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:52,357 INFO L225 Difference]: With dead ends: 324 [2022-07-12 19:00:52,357 INFO L226 Difference]: Without dead ends: 324 [2022-07-12 19:00:52,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 96 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=154, Invalid=1036, Unknown=8, NotChecked=134, Total=1332 [2022-07-12 19:00:52,358 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 93 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:52,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1056 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 230 Invalid, 0 Unknown, 294 Unchecked, 0.3s Time] [2022-07-12 19:00:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-12 19:00:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 307. [2022-07-12 19:00:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 237 states have (on average 1.2320675105485233) internal successors, (292), 261 states have internal predecessors, (292), 29 states have call successors, (29), 22 states have call predecessors, (29), 22 states have return successors, (29), 23 states have call predecessors, (29), 29 states have call successors, (29) [2022-07-12 19:00:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 350 transitions. [2022-07-12 19:00:52,365 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 350 transitions. Word has length 40 [2022-07-12 19:00:52,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:52,365 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 350 transitions. [2022-07-12 19:00:52,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:00:52,365 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 350 transitions. [2022-07-12 19:00:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:00:52,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:52,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:52,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:52,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Ended with exit code 0 [2022-07-12 19:00:52,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 19:00:52,767 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:52,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:52,768 INFO L85 PathProgramCache]: Analyzing trace with hash 318176131, now seen corresponding path program 1 times [2022-07-12 19:00:52,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:52,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216455685] [2022-07-12 19:00:52,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:52,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:52,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:52,770 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:52,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-07-12 19:00:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:52,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 19:00:52,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:52,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:52,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:52,975 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:00:52,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:00:53,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:53,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:53,229 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:00:53,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-12 19:00:53,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 19:00:53,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:00:53,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-12 19:00:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:53,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:53,616 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1475) |c_ULTIMATE.start_main_~x~0#1.base|) .cse0))))) (forall ((v_ArrVal_1476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-12 19:00:53,644 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|))) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1476) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1475) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))))) (forall ((v_ArrVal_1476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_1476) |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2022-07-12 19:00:53,681 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) v_ArrVal_1476) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1476) |c_ULTIMATE.start_main_~x~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1475) |c_ULTIMATE.start_main_~x~0#1.base|) .cse3))))))) is different from false [2022-07-12 19:00:53,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:53,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216455685] [2022-07-12 19:00:53,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216455685] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:00:53,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1088989546] [2022-07-12 19:00:53,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:53,708 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:00:53,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:00:53,709 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:00:53,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2022-07-12 19:00:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:53,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 19:00:53,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:54,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:54,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:54,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:54,716 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:00:54,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2022-07-12 19:00:54,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:00:54,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 19:00:55,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:00:55,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-12 19:00:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:55,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:56,071 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1523) |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1523) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1522) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)))))) is different from false [2022-07-12 19:00:56,103 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|)) v_ArrVal_1523) |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_remove_~x#1.offset|))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1523) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1522) |c_ULTIMATE.start_main_~x~0#1.base|) .cse2)))))) is different from false [2022-07-12 19:00:56,165 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1523) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1522) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse3) v_ArrVal_1523) |c_ULTIMATE.start_main_~x~0#1.base|) .cse3)))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2022-07-12 19:00:56,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1088989546] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:00:56,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:56,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-07-12 19:00:56,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298683163] [2022-07-12 19:00:56,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:56,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 19:00:56,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:56,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 19:00:56,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=434, Unknown=6, NotChecked=282, Total=812 [2022-07-12 19:00:56,210 INFO L87 Difference]: Start difference. First operand 307 states and 350 transitions. Second operand has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:00:56,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:56,686 INFO L93 Difference]: Finished difference Result 316 states and 359 transitions. [2022-07-12 19:00:56,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:00:56,687 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-07-12 19:00:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:56,688 INFO L225 Difference]: With dead ends: 316 [2022-07-12 19:00:56,688 INFO L226 Difference]: Without dead ends: 316 [2022-07-12 19:00:56,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 93 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=111, Invalid=557, Unknown=6, NotChecked=318, Total=992 [2022-07-12 19:00:56,689 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 79 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:56,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 849 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 207 Invalid, 0 Unknown, 136 Unchecked, 0.3s Time] [2022-07-12 19:00:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-07-12 19:00:56,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 307. [2022-07-12 19:00:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 237 states have (on average 1.2278481012658229) internal successors, (291), 261 states have internal predecessors, (291), 29 states have call successors, (29), 22 states have call predecessors, (29), 22 states have return successors, (29), 23 states have call predecessors, (29), 29 states have call successors, (29) [2022-07-12 19:00:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 349 transitions. [2022-07-12 19:00:56,695 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 349 transitions. Word has length 40 [2022-07-12 19:00:56,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:56,695 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 349 transitions. [2022-07-12 19:00:56,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.736842105263158) internal successors, (71), 20 states have internal predecessors, (71), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:00:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 349 transitions. [2022-07-12 19:00:56,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:00:56,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:56,696 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:56,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (44)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:56,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:57,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:57,101 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:57,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:57,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1343891098, now seen corresponding path program 1 times [2022-07-12 19:00:57,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:57,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681556567] [2022-07-12 19:00:57,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:57,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:57,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:57,104 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:57,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-07-12 19:00:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:57,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:00:57,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:57,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 19:00:57,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 19:00:57,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 19:00:57,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 19:00:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 19:00:57,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:00:57,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:57,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681556567] [2022-07-12 19:00:57,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681556567] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:00:57,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:00:57,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:00:57,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674284157] [2022-07-12 19:00:57,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:00:57,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:00:57,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:57,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:00:57,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:00:57,328 INFO L87 Difference]: Start difference. First operand 307 states and 349 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 19:00:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:57,336 INFO L93 Difference]: Finished difference Result 314 states and 357 transitions. [2022-07-12 19:00:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:00:57,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-07-12 19:00:57,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:57,337 INFO L225 Difference]: With dead ends: 314 [2022-07-12 19:00:57,338 INFO L226 Difference]: Without dead ends: 285 [2022-07-12 19:00:57,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:00:57,338 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:57,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 70 Unchecked, 0.0s Time] [2022-07-12 19:00:57,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-12 19:00:57,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-07-12 19:00:57,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 219 states have (on average 1.2420091324200913) internal successors, (272), 243 states have internal predecessors, (272), 27 states have call successors, (27), 20 states have call predecessors, (27), 20 states have return successors, (27), 21 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-12 19:00:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 326 transitions. [2022-07-12 19:00:57,345 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 326 transitions. Word has length 43 [2022-07-12 19:00:57,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:57,346 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 326 transitions. [2022-07-12 19:00:57,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 19:00:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 326 transitions. [2022-07-12 19:00:57,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:00:57,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:57,347 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, 1, 1] [2022-07-12 19:00:57,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:57,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:57,556 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:57,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:57,557 INFO L85 PathProgramCache]: Analyzing trace with hash -982902293, now seen corresponding path program 1 times [2022-07-12 19:00:57,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:57,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100727271] [2022-07-12 19:00:57,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:57,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:57,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:57,558 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:57,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-07-12 19:00:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:57,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 19:00:57,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:00:57,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:00:57,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:57,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100727271] [2022-07-12 19:00:57,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100727271] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:00:57,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:57,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-07-12 19:00:57,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777999319] [2022-07-12 19:00:57,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:57,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:00:57,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:57,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:00:57,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:00:57,986 INFO L87 Difference]: Start difference. First operand 285 states and 326 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 19:00:58,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:58,242 INFO L93 Difference]: Finished difference Result 283 states and 317 transitions. [2022-07-12 19:00:58,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:00:58,243 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2022-07-12 19:00:58,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:58,244 INFO L225 Difference]: With dead ends: 283 [2022-07-12 19:00:58,244 INFO L226 Difference]: Without dead ends: 283 [2022-07-12 19:00:58,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-07-12 19:00:58,244 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 208 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:58,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 363 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:00:58,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-12 19:00:58,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 274. [2022-07-12 19:00:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 213 states have (on average 1.2347417840375587) internal successors, (263), 234 states have internal predecessors, (263), 24 states have call successors, (24), 18 states have call predecessors, (24), 18 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-12 19:00:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 311 transitions. [2022-07-12 19:00:58,249 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 311 transitions. Word has length 42 [2022-07-12 19:00:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:58,250 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 311 transitions. [2022-07-12 19:00:58,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 19:00:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 311 transitions. [2022-07-12 19:00:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:00:58,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:58,250 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:58,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:58,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:00:58,460 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:00:58,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:58,461 INFO L85 PathProgramCache]: Analyzing trace with hash 578980905, now seen corresponding path program 2 times [2022-07-12 19:00:58,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:00:58,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667763929] [2022-07-12 19:00:58,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:00:58,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:00:58,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:00:58,462 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:00:58,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-07-12 19:00:58,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:00:58,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:00:58,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 19:00:58,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:58,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:00:58,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:00:58,969 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:58,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2022-07-12 19:00:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:00:59,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:59,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-07-12 19:00:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:00:59,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:00:59,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667763929] [2022-07-12 19:00:59,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667763929] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:00:59,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:00:59,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-07-12 19:00:59,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687940418] [2022-07-12 19:00:59,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:59,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 19:00:59,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:00:59,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 19:00:59,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-07-12 19:00:59,478 INFO L87 Difference]: Start difference. First operand 274 states and 311 transitions. Second operand has 19 states, 16 states have (on average 3.0) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 19:01:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:01:00,360 INFO L93 Difference]: Finished difference Result 298 states and 337 transitions. [2022-07-12 19:01:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 19:01:00,361 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.0) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2022-07-12 19:01:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:01:00,362 INFO L225 Difference]: With dead ends: 298 [2022-07-12 19:01:00,362 INFO L226 Difference]: Without dead ends: 298 [2022-07-12 19:01:00,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-07-12 19:01:00,362 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 127 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:01:00,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 509 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 387 Invalid, 0 Unknown, 218 Unchecked, 0.6s Time] [2022-07-12 19:01:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-12 19:01:00,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 273. [2022-07-12 19:01:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 233 states have internal predecessors, (262), 24 states have call successors, (24), 18 states have call predecessors, (24), 18 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-12 19:01:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 310 transitions. [2022-07-12 19:01:00,368 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 310 transitions. Word has length 42 [2022-07-12 19:01:00,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:01:00,368 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 310 transitions. [2022-07-12 19:01:00,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.0) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 19:01:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 310 transitions. [2022-07-12 19:01:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:01:00,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:01:00,369 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:01:00,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2022-07-12 19:01:00,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:01:00,580 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:01:00,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:01:00,580 INFO L85 PathProgramCache]: Analyzing trace with hash 578980906, now seen corresponding path program 1 times [2022-07-12 19:01:00,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:01:00,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789806685] [2022-07-12 19:01:00,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:01:00,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:01:00,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:01:00,582 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:01:00,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2022-07-12 19:01:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:01:00,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 19:01:00,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:01:00,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:01:00,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:01:01,108 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:01:01,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2022-07-12 19:01:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:01:01,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:01:01,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:01:01,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789806685] [2022-07-12 19:01:01,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789806685] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:01:01,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [615377151] [2022-07-12 19:01:01,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:01:01,596 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:01:01,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:01:01,598 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:01:01,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2022-07-12 19:01:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:01:01,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 19:01:01,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:01:02,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:01:02,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:01:02,653 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:01:02,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2022-07-12 19:01:02,685 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:01:02,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:01:03,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2022-07-12 19:01:03,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-12 19:01:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:01:03,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [615377151] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:01:03,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:01:03,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 37 [2022-07-12 19:01:03,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083723707] [2022-07-12 19:01:03,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:01:03,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-12 19:01:03,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:01:03,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-12 19:01:03,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1460, Unknown=0, NotChecked=0, Total=1640 [2022-07-12 19:01:03,688 INFO L87 Difference]: Start difference. First operand 273 states and 310 transitions. Second operand has 38 states, 34 states have (on average 3.0588235294117645) internal successors, (104), 36 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:01:05,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:01:05,602 INFO L93 Difference]: Finished difference Result 326 states and 378 transitions. [2022-07-12 19:01:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 19:01:05,603 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 3.0588235294117645) internal successors, (104), 36 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2022-07-12 19:01:05,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:01:05,604 INFO L225 Difference]: With dead ends: 326 [2022-07-12 19:01:05,604 INFO L226 Difference]: Without dead ends: 326 [2022-07-12 19:01:05,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=284, Invalid=1972, Unknown=0, NotChecked=0, Total=2256 [2022-07-12 19:01:05,605 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 183 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:01:05,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1011 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 982 Invalid, 0 Unknown, 278 Unchecked, 1.6s Time] [2022-07-12 19:01:05,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-07-12 19:01:05,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 269. [2022-07-12 19:01:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 213 states have (on average 1.2112676056338028) internal successors, (258), 229 states have internal predecessors, (258), 24 states have call successors, (24), 18 states have call predecessors, (24), 18 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-12 19:01:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2022-07-12 19:01:05,611 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 42 [2022-07-12 19:01:05,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:01:05,612 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2022-07-12 19:01:05,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 3.0588235294117645) internal successors, (104), 36 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:01:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2022-07-12 19:01:05,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:01:05,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:01:05,613 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, 1, 1, 1] [2022-07-12 19:01:05,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (49)] Forceful destruction successful, exit code 0 [2022-07-12 19:01:05,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2022-07-12 19:01:06,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:01:06,017 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:01:06,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:01:06,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1984961000, now seen corresponding path program 1 times [2022-07-12 19:01:06,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:01:06,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185946601] [2022-07-12 19:01:06,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:01:06,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:01:06,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:01:06,019 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:01:06,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-07-12 19:01:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:01:06,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 19:01:06,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:01:06,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:01:06,293 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:01:06,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:01:06,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:01:08,353 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_47| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|) (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_47|)) |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|))) is different from true [2022-07-12 19:01:08,474 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:01:08,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 36 [2022-07-12 19:01:08,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-12 19:01:08,734 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:01:08,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-07-12 19:01:08,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 19:01:08,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:01:08,758 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 19:01:08,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2022-07-12 19:01:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:01:08,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:01:08,830 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_re_insert_#t~mem10#1.base| v_ArrVal_1857) |c_ULTIMATE.start_re_insert_~x#1.base|) |c_ULTIMATE.start_re_insert_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1858 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_re_insert_#t~mem10#1.base| v_ArrVal_1858) |c_ULTIMATE.start_re_insert_~x#1.base|) |c_ULTIMATE.start_re_insert_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:01:08,840 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1858 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_re_insert_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_re_insert_~x#1.offset|)) v_ArrVal_1858) |c_ULTIMATE.start_re_insert_~x#1.base|) |c_ULTIMATE.start_re_insert_~x#1.offset|))) (forall ((v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_re_insert_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_re_insert_~x#1.offset|)) v_ArrVal_1857) |c_ULTIMATE.start_re_insert_~x#1.base|) |c_ULTIMATE.start_re_insert_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:01:08,870 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1857) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (forall ((v_ArrVal_1858 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1858) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:01:08,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:01:08,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185946601] [2022-07-12 19:01:08,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1185946601] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:01:08,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2135480927] [2022-07-12 19:01:08,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:01:08,881 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:01:08,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:01:08,884 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:01:08,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2022-07-12 19:01:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:01:09,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-12 19:01:09,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:01:09,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:01:09,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:01:11,539 WARN L855 $PredicateComparison]: unable to prove that (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_55| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_55|) (bvult (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_55|) (_ bv4 32)) |#StackHeapBarrier|))) is different from true [2022-07-12 19:01:11,841 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:01:11,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 35 [2022-07-12 19:01:11,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-12 19:01:12,686 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:01:12,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2022-07-12 19:01:12,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:01:12,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 19:01:12,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:01:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:01:12,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:01:12,807 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_re_insert_#t~mem10#1.base| v_ArrVal_1911) |c_ULTIMATE.start_re_insert_~x#1.base|) |c_ULTIMATE.start_re_insert_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_re_insert_#t~mem10#1.base| v_ArrVal_1912) |c_ULTIMATE.start_re_insert_~x#1.base|) |c_ULTIMATE.start_re_insert_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:01:12,815 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_re_insert_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_re_insert_~x#1.offset|)) v_ArrVal_1912) |c_ULTIMATE.start_re_insert_~x#1.base|) |c_ULTIMATE.start_re_insert_~x#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_re_insert_~x#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_re_insert_~x#1.offset|)) v_ArrVal_1911) |c_ULTIMATE.start_re_insert_~x#1.base|) |c_ULTIMATE.start_re_insert_~x#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:01:12,832 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1911) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1912) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 19:01:12,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2135480927] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:01:12,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:01:12,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-07-12 19:01:12,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376129790] [2022-07-12 19:01:12,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:01:12,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 19:01:12,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:01:12,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 19:01:12,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=618, Unknown=8, NotChecked=456, Total=1190 [2022-07-12 19:01:12,841 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 states have internal predecessors, (79), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:01:14,989 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_47| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|) (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_BEFORE_CALL_47|)) |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_53|))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_55| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_55|) (bvult (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_55|) (_ bv4 32)) |#StackHeapBarrier|)))) is different from true [2022-07-12 19:01:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:01:15,062 INFO L93 Difference]: Finished difference Result 275 states and 312 transitions. [2022-07-12 19:01:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:01:15,062 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 states have internal predecessors, (79), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 45 [2022-07-12 19:01:15,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:01:15,063 INFO L225 Difference]: With dead ends: 275 [2022-07-12 19:01:15,063 INFO L226 Difference]: Without dead ends: 275 [2022-07-12 19:01:15,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=131, Invalid=766, Unknown=9, NotChecked=576, Total=1482 [2022-07-12 19:01:15,064 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 15 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:01:15,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 801 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 259 Unchecked, 0.1s Time] [2022-07-12 19:01:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-12 19:01:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 270. [2022-07-12 19:01:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.2102803738317758) internal successors, (259), 230 states have internal predecessors, (259), 24 states have call successors, (24), 18 states have call predecessors, (24), 18 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-12 19:01:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 307 transitions. [2022-07-12 19:01:15,069 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 307 transitions. Word has length 45 [2022-07-12 19:01:15,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:01:15,070 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 307 transitions. [2022-07-12 19:01:15,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 states have internal predecessors, (79), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:01:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 307 transitions. [2022-07-12 19:01:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:01:15,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:01:15,071 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:01:15,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (51)] Forceful destruction successful, exit code 0 [2022-07-12 19:01:15,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2022-07-12 19:01:15,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:01:15,481 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:01:15,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:01:15,481 INFO L85 PathProgramCache]: Analyzing trace with hash -950221421, now seen corresponding path program 2 times [2022-07-12 19:01:15,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:01:15,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362288776] [2022-07-12 19:01:15,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:01:15,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:01:15,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:01:15,483 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:01:15,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2022-07-12 19:01:15,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 19:01:15,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:01:15,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 19:01:15,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:01:15,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:01:15,813 INFO L356 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2022-07-12 19:01:15,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 57 [2022-07-12 19:01:15,837 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:01:15,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 19:01:16,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:01:16,448 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:01:16,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 100 [2022-07-12 19:01:16,723 INFO L356 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-07-12 19:01:16,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 33 [2022-07-12 19:01:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 19:01:16,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:01:16,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:01:16,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362288776] [2022-07-12 19:01:16,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362288776] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:01:16,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:01:16,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 19:01:16,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999645609] [2022-07-12 19:01:16,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:01:16,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 19:01:16,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:01:16,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 19:01:16,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-12 19:01:16,753 INFO L87 Difference]: Start difference. First operand 270 states and 307 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:01:17,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:01:17,069 INFO L93 Difference]: Finished difference Result 271 states and 306 transitions. [2022-07-12 19:01:17,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 19:01:17,070 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-07-12 19:01:17,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:01:17,071 INFO L225 Difference]: With dead ends: 271 [2022-07-12 19:01:17,071 INFO L226 Difference]: Without dead ends: 271 [2022-07-12 19:01:17,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-07-12 19:01:17,071 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 40 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:01:17,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 460 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 153 Unchecked, 0.2s Time] [2022-07-12 19:01:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-12 19:01:17,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2022-07-12 19:01:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.205607476635514) internal successors, (258), 230 states have internal predecessors, (258), 24 states have call successors, (24), 18 states have call predecessors, (24), 18 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-12 19:01:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 306 transitions. [2022-07-12 19:01:17,075 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 306 transitions. Word has length 46 [2022-07-12 19:01:17,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:01:17,076 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 306 transitions. [2022-07-12 19:01:17,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:01:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 306 transitions. [2022-07-12 19:01:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:01:17,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:01:17,077 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:01:17,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (52)] Forceful destruction successful, exit code 0 [2022-07-12 19:01:17,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:01:17,286 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:01:17,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:01:17,287 INFO L85 PathProgramCache]: Analyzing trace with hash -950221420, now seen corresponding path program 2 times [2022-07-12 19:01:17,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:01:17,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005473037] [2022-07-12 19:01:17,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:01:17,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:01:17,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:01:17,288 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:01:17,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2022-07-12 19:01:17,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 19:01:17,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:01:17,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 19:01:17,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:01:17,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:01:17,638 INFO L356 Elim1Store]: treesize reduction 62, result has 34.7 percent of original size [2022-07-12 19:01:17,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 83 [2022-07-12 19:01:17,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:01:17,676 INFO L356 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2022-07-12 19:01:17,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 79 [2022-07-12 19:01:18,851 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-12 19:01:18,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 52 [2022-07-12 19:01:18,865 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 19:01:18,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 43 [2022-07-12 19:01:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 19:01:18,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:01:18,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:01:18,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005473037] [2022-07-12 19:01:18,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005473037] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:01:18,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:01:18,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 19:01:18,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204416189] [2022-07-12 19:01:18,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:01:18,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 19:01:18,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:01:18,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 19:01:18,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-07-12 19:01:18,924 INFO L87 Difference]: Start difference. First operand 270 states and 306 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:01:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:01:20,902 INFO L93 Difference]: Finished difference Result 283 states and 316 transitions. [2022-07-12 19:01:20,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 19:01:20,902 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-07-12 19:01:20,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:01:20,903 INFO L225 Difference]: With dead ends: 283 [2022-07-12 19:01:20,903 INFO L226 Difference]: Without dead ends: 283 [2022-07-12 19:01:20,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2022-07-12 19:01:20,904 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 119 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 19:01:20,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 482 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 298 Invalid, 0 Unknown, 48 Unchecked, 0.9s Time] [2022-07-12 19:01:20,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-12 19:01:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 270. [2022-07-12 19:01:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.2009345794392523) internal successors, (257), 230 states have internal predecessors, (257), 24 states have call successors, (24), 18 states have call predecessors, (24), 18 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-12 19:01:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 305 transitions. [2022-07-12 19:01:20,921 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 305 transitions. Word has length 46 [2022-07-12 19:01:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:01:20,922 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 305 transitions. [2022-07-12 19:01:20,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:01:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 305 transitions. [2022-07-12 19:01:20,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:01:20,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:01:20,923 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:01:20,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (53)] Forceful destruction successful, exit code 0 [2022-07-12 19:01:21,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:01:21,132 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-12 19:01:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:01:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1746455468, now seen corresponding path program 1 times [2022-07-12 19:01:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:01:21,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745381830] [2022-07-12 19:01:21,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:01:21,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:01:21,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:01:21,135 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:01:21,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (54)] Waiting until timeout for monitored process [2022-07-12 19:01:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:01:21,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-12 19:01:21,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:01:21,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:01:21,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:01:21,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:01:21,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:01:21,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:01:21,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:01:21,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:01:21,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:01:22,030 INFO L356 Elim1Store]: treesize reduction 110, result has 22.5 percent of original size [2022-07-12 19:01:22,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 78 treesize of output 72 [2022-07-12 19:01:22,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:01:22,076 INFO L356 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-07-12 19:01:22,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 53 [2022-07-12 19:01:22,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:01:22,692 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:01:22,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 18 [2022-07-12 19:01:22,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:01:22,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-12 19:01:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 19:01:22,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:01:42,065 WARN L233 SmtUtils]: Spent 18.21s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:02:02,872 WARN L233 SmtUtils]: Spent 18.19s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:02:27,795 WARN L233 SmtUtils]: Spent 18.23s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:02:53,198 WARN L233 SmtUtils]: Spent 18.44s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)