./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-reverse.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 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:40:11,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:40:11,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:40:11,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:40:11,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:40:11,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:40:11,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:40:11,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:40:11,831 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:40:11,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:40:11,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:40:11,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:40:11,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:40:11,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:40:11,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:40:11,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:40:11,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:40:11,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:40:11,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:40:11,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:40:11,854 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:40:11,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:40:11,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:40:11,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:40:11,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:40:11,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:40:11,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:40:11,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:40:11,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:40:11,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:40:11,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:40:11,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:40:11,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:40:11,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:40:11,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:40:11,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:40:11,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:40:11,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:40:11,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:40:11,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:40:11,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:40:11,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:40:11,881 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:40:11,910 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:40:11,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:40:11,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:40:11,918 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:40:11,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:40:11,919 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:40:11,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:40:11,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:40:11,919 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:40:11,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:40:11,921 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:40:11,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:40:11,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:40:11,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:40:11,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:40:11,922 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:40:11,922 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:40:11,922 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:40:11,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:40:11,922 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:40:11,922 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:40:11,923 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:40:11,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:40:11,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:40:11,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:40:11,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:40:11,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:40:11,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:40:11,924 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:40:11,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:40:11,925 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 -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2022-07-14 06:40:12,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:40:12,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:40:12,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:40:12,167 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:40:12,168 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:40:12,169 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-reverse.i [2022-07-14 06:40:12,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e62e0ee/24c3b2adff514130ba32d88c1e2c34b9/FLAG18d13cd4d [2022-07-14 06:40:12,642 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:40:12,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i [2022-07-14 06:40:12,651 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e62e0ee/24c3b2adff514130ba32d88c1e2c34b9/FLAG18d13cd4d [2022-07-14 06:40:12,666 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e62e0ee/24c3b2adff514130ba32d88c1e2c34b9 [2022-07-14 06:40:12,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:40:12,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:40:12,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:40:12,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:40:12,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:40:12,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:40:12" (1/1) ... [2022-07-14 06:40:12,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12acf902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:12, skipping insertion in model container [2022-07-14 06:40:12,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:40:12" (1/1) ... [2022-07-14 06:40:12,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:40:12,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:40:12,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22309,22322] [2022-07-14 06:40:12,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22394,22407] [2022-07-14 06:40:13,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22924,22937] [2022-07-14 06:40:13,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:40:13,016 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:40:13,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22309,22322] [2022-07-14 06:40:13,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22394,22407] [2022-07-14 06:40:13,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22924,22937] [2022-07-14 06:40:13,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:40:13,069 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:40:13,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:13 WrapperNode [2022-07-14 06:40:13,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:40:13,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:40:13,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:40:13,071 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:40:13,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:13" (1/1) ... [2022-07-14 06:40:13,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:13" (1/1) ... [2022-07-14 06:40:13,107 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 147 [2022-07-14 06:40:13,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:40:13,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:40:13,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:40:13,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:40:13,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:13" (1/1) ... [2022-07-14 06:40:13,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:13" (1/1) ... [2022-07-14 06:40:13,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:13" (1/1) ... [2022-07-14 06:40:13,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:13" (1/1) ... [2022-07-14 06:40:13,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:13" (1/1) ... [2022-07-14 06:40:13,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:13" (1/1) ... [2022-07-14 06:40:13,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:13" (1/1) ... [2022-07-14 06:40:13,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:40:13,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:40:13,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:40:13,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:40:13,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:13" (1/1) ... [2022-07-14 06:40:13,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:40:13,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:40:13,169 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-14 06:40:13,171 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-14 06:40:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 06:40:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:40:13,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:40:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:40:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:40:13,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:40:13,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:40:13,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:40:13,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:40:13,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:40:13,274 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:40:13,276 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:40:13,702 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:40:13,711 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:40:13,712 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-14 06:40:13,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:40:13 BoogieIcfgContainer [2022-07-14 06:40:13,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:40:13,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:40:13,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:40:13,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:40:13,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:40:12" (1/3) ... [2022-07-14 06:40:13,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d84c49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:40:13, skipping insertion in model container [2022-07-14 06:40:13,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:13" (2/3) ... [2022-07-14 06:40:13,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d84c49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:40:13, skipping insertion in model container [2022-07-14 06:40:13,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:40:13" (3/3) ... [2022-07-14 06:40:13,723 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2022-07-14 06:40:13,736 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:40:13,736 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 69 error locations. [2022-07-14 06:40:13,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:40:13,797 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@fe5a114, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@480c6d92 [2022-07-14 06:40:13,798 INFO L358 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2022-07-14 06:40:13,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 79 states have (on average 2.1645569620253164) internal successors, (171), 148 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:13,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:40:13,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:13,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:40:13,807 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:13,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:13,811 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 06:40:13,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:13,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181717915] [2022-07-14 06:40:13,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:13,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:13,963 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-14 06:40:13,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:13,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181717915] [2022-07-14 06:40:13,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181717915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:13,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:13,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:40:13,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50045941] [2022-07-14 06:40:13,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:13,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:40:13,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:13,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:40:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:40:14,002 INFO L87 Difference]: Start difference. First operand has 149 states, 79 states have (on average 2.1645569620253164) internal successors, (171), 148 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-14 06:40:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:14,109 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-07-14 06:40:14,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:40:14,112 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-14 06:40:14,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:14,120 INFO L225 Difference]: With dead ends: 146 [2022-07-14 06:40:14,120 INFO L226 Difference]: Without dead ends: 144 [2022-07-14 06:40:14,121 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-14 06:40:14,124 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 100 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:14,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 128 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:40:14,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-14 06:40:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-07-14 06:40:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 78 states have (on average 1.9487179487179487) internal successors, (152), 143 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:14,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2022-07-14 06:40:14,180 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 3 [2022-07-14 06:40:14,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:14,180 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2022-07-14 06:40:14,180 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-14 06:40:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2022-07-14 06:40:14,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:40:14,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:14,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:40:14,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:40:14,182 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 06:40:14,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:14,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730098615] [2022-07-14 06:40:14,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:14,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:14,247 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-14 06:40:14,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:14,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730098615] [2022-07-14 06:40:14,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730098615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:14,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:14,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:40:14,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054839528] [2022-07-14 06:40:14,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:14,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:40:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:14,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:40:14,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:40:14,256 INFO L87 Difference]: Start difference. First operand 144 states and 152 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-14 06:40:14,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:14,371 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2022-07-14 06:40:14,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:40:14,372 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-14 06:40:14,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:14,376 INFO L225 Difference]: With dead ends: 141 [2022-07-14 06:40:14,376 INFO L226 Difference]: Without dead ends: 141 [2022-07-14 06:40:14,377 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-14 06:40:14,378 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 97 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:14,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 124 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:40:14,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-14 06:40:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-07-14 06:40:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 78 states have (on average 1.9102564102564104) internal successors, (149), 140 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2022-07-14 06:40:14,402 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 3 [2022-07-14 06:40:14,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:14,404 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2022-07-14 06:40:14,404 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-14 06:40:14,405 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2022-07-14 06:40:14,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 06:40:14,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:14,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:14,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:40:14,406 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:14,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:14,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2022-07-14 06:40:14,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:14,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840301864] [2022-07-14 06:40:14,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:14,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:14,537 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-14 06:40:14,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:14,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840301864] [2022-07-14 06:40:14,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840301864] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:14,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:14,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:40:14,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067189960] [2022-07-14 06:40:14,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:14,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:40:14,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:14,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:40:14,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:40:14,542 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:14,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:14,701 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2022-07-14 06:40:14,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:40:14,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-14 06:40:14,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:14,703 INFO L225 Difference]: With dead ends: 132 [2022-07-14 06:40:14,704 INFO L226 Difference]: Without dead ends: 132 [2022-07-14 06:40:14,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:40:14,716 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 168 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:14,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 90 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:40:14,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-14 06:40:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2022-07-14 06:40:14,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.7073170731707317) internal successors, (140), 127 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-07-14 06:40:14,735 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 9 [2022-07-14 06:40:14,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:14,736 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-07-14 06:40:14,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-07-14 06:40:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 06:40:14,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:14,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:14,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:40:14,738 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:14,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:14,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2022-07-14 06:40:14,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:14,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337525375] [2022-07-14 06:40:14,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:14,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:14,855 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-14 06:40:14,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:14,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337525375] [2022-07-14 06:40:14,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337525375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:14,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:14,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:40:14,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102174572] [2022-07-14 06:40:14,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:14,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:40:14,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:14,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:40:14,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:40:14,858 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:15,039 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2022-07-14 06:40:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:40:15,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-14 06:40:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:15,041 INFO L225 Difference]: With dead ends: 176 [2022-07-14 06:40:15,041 INFO L226 Difference]: Without dead ends: 176 [2022-07-14 06:40:15,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:40:15,042 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 176 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:15,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 137 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:40:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-14 06:40:15,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 157. [2022-07-14 06:40:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 111 states have (on average 1.5945945945945945) internal successors, (177), 156 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2022-07-14 06:40:15,047 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 9 [2022-07-14 06:40:15,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:15,048 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2022-07-14 06:40:15,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2022-07-14 06:40:15,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:40:15,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:15,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:15,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:40:15,049 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:15,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:15,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-07-14 06:40:15,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:15,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654278297] [2022-07-14 06:40:15,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:15,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:15,117 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-14 06:40:15,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:15,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654278297] [2022-07-14 06:40:15,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654278297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:15,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:15,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:40:15,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324698608] [2022-07-14 06:40:15,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:15,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:40:15,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:15,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:40:15,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:40:15,120 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:15,300 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2022-07-14 06:40:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:40:15,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 06:40:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:15,301 INFO L225 Difference]: With dead ends: 156 [2022-07-14 06:40:15,301 INFO L226 Difference]: Without dead ends: 156 [2022-07-14 06:40:15,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:40:15,302 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:15,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 297 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:40:15,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-14 06:40:15,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-07-14 06:40:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 111 states have (on average 1.5765765765765767) internal successors, (175), 155 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2022-07-14 06:40:15,306 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 12 [2022-07-14 06:40:15,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:15,307 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2022-07-14 06:40:15,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:15,307 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2022-07-14 06:40:15,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:40:15,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:15,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:15,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:40:15,308 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:15,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:15,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-07-14 06:40:15,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:15,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495333354] [2022-07-14 06:40:15,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:15,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:15,352 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-14 06:40:15,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:15,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495333354] [2022-07-14 06:40:15,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495333354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:15,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:15,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:40:15,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604122134] [2022-07-14 06:40:15,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:15,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:40:15,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:15,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:40:15,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:40:15,355 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:15,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:15,497 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2022-07-14 06:40:15,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:40:15,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 06:40:15,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:15,498 INFO L225 Difference]: With dead ends: 155 [2022-07-14 06:40:15,499 INFO L226 Difference]: Without dead ends: 155 [2022-07-14 06:40:15,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:40:15,500 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 7 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:15,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 315 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:40:15,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-14 06:40:15,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-07-14 06:40:15,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 111 states have (on average 1.5585585585585586) internal successors, (173), 154 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2022-07-14 06:40:15,504 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 12 [2022-07-14 06:40:15,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:15,504 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2022-07-14 06:40:15,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2022-07-14 06:40:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:40:15,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:15,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:15,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:40:15,506 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:15,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:15,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1455563597, now seen corresponding path program 1 times [2022-07-14 06:40:15,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:15,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680628281] [2022-07-14 06:40:15,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:15,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:15,541 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-14 06:40:15,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:15,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680628281] [2022-07-14 06:40:15,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680628281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:15,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:15,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:40:15,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942400335] [2022-07-14 06:40:15,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:15,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:40:15,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:15,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:40:15,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:40:15,543 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:15,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:15,656 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2022-07-14 06:40:15,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:40:15,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-14 06:40:15,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:15,658 INFO L225 Difference]: With dead ends: 167 [2022-07-14 06:40:15,658 INFO L226 Difference]: Without dead ends: 167 [2022-07-14 06:40:15,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:40:15,658 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 158 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:15,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 190 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:40:15,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-14 06:40:15,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 155. [2022-07-14 06:40:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 111 states have (on average 1.5315315315315314) internal successors, (170), 154 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 170 transitions. [2022-07-14 06:40:15,662 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 170 transitions. Word has length 15 [2022-07-14 06:40:15,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:15,662 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 170 transitions. [2022-07-14 06:40:15,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2022-07-14 06:40:15,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:40:15,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:15,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:15,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:40:15,664 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:15,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:15,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-07-14 06:40:15,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:15,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820955033] [2022-07-14 06:40:15,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:15,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:15,770 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-14 06:40:15,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:15,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820955033] [2022-07-14 06:40:15,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820955033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:15,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:15,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:40:15,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581935983] [2022-07-14 06:40:15,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:15,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:40:15,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:15,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:40:15,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:40:15,773 INFO L87 Difference]: Start difference. First operand 155 states and 170 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:16,081 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2022-07-14 06:40:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:40:16,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:40:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:16,082 INFO L225 Difference]: With dead ends: 155 [2022-07-14 06:40:16,082 INFO L226 Difference]: Without dead ends: 155 [2022-07-14 06:40:16,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:40:16,083 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 168 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:16,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 247 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:40:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-14 06:40:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2022-07-14 06:40:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 153 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2022-07-14 06:40:16,087 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 16 [2022-07-14 06:40:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:16,087 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2022-07-14 06:40:16,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2022-07-14 06:40:16,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:40:16,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:16,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:16,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:40:16,093 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:16,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:16,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-07-14 06:40:16,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:16,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528919675] [2022-07-14 06:40:16,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:16,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:16,224 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-14 06:40:16,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:16,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528919675] [2022-07-14 06:40:16,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528919675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:16,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:16,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:40:16,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122891222] [2022-07-14 06:40:16,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:16,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:40:16,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:16,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:40:16,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:40:16,227 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:16,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:16,769 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2022-07-14 06:40:16,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:40:16,770 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:40:16,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:16,771 INFO L225 Difference]: With dead ends: 152 [2022-07-14 06:40:16,771 INFO L226 Difference]: Without dead ends: 152 [2022-07-14 06:40:16,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-07-14 06:40:16,772 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 159 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:16,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 333 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:40:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-14 06:40:16,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 141. [2022-07-14 06:40:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 103 states have (on average 1.5048543689320388) internal successors, (155), 140 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2022-07-14 06:40:16,775 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 16 [2022-07-14 06:40:16,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:16,775 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2022-07-14 06:40:16,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:16,776 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2022-07-14 06:40:16,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:40:16,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:16,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:16,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 06:40:16,776 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:16,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:16,777 INFO L85 PathProgramCache]: Analyzing trace with hash 743663712, now seen corresponding path program 1 times [2022-07-14 06:40:16,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:16,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730921276] [2022-07-14 06:40:16,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:16,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:16,844 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-14 06:40:16,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:16,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730921276] [2022-07-14 06:40:16,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730921276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:16,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:16,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:40:16,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270344745] [2022-07-14 06:40:16,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:16,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:40:16,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:16,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:40:16,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:40:16,847 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:17,006 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2022-07-14 06:40:17,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:40:17,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:40:17,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:17,007 INFO L225 Difference]: With dead ends: 162 [2022-07-14 06:40:17,007 INFO L226 Difference]: Without dead ends: 162 [2022-07-14 06:40:17,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:40:17,008 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 27 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:17,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 442 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:40:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-14 06:40:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2022-07-14 06:40:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 111 states have (on average 1.4774774774774775) internal successors, (164), 148 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:17,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2022-07-14 06:40:17,012 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 18 [2022-07-14 06:40:17,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:17,012 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2022-07-14 06:40:17,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:17,012 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2022-07-14 06:40:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:40:17,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:17,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:17,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 06:40:17,013 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:17,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:17,013 INFO L85 PathProgramCache]: Analyzing trace with hash -573987105, now seen corresponding path program 1 times [2022-07-14 06:40:17,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:17,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980333929] [2022-07-14 06:40:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:17,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,080 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-14 06:40:17,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:17,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980333929] [2022-07-14 06:40:17,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980333929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:17,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:17,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:40:17,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091364237] [2022-07-14 06:40:17,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:17,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:40:17,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:17,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:40:17,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:40:17,083 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:17,242 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2022-07-14 06:40:17,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:40:17,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 06:40:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:17,244 INFO L225 Difference]: With dead ends: 168 [2022-07-14 06:40:17,244 INFO L226 Difference]: Without dead ends: 168 [2022-07-14 06:40:17,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:40:17,245 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 25 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:17,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 319 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:40:17,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-14 06:40:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2022-07-14 06:40:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 121 states have (on average 1.462809917355372) internal successors, (177), 158 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2022-07-14 06:40:17,249 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 20 [2022-07-14 06:40:17,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:17,249 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2022-07-14 06:40:17,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:17,250 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2022-07-14 06:40:17,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:40:17,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:17,250 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] [2022-07-14 06:40:17,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 06:40:17,251 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:17,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1867739349, now seen corresponding path program 1 times [2022-07-14 06:40:17,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:17,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790857345] [2022-07-14 06:40:17,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:17,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,287 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-14 06:40:17,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:17,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790857345] [2022-07-14 06:40:17,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790857345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:17,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:17,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:40:17,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903451357] [2022-07-14 06:40:17,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:17,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:40:17,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:17,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:40:17,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:40:17,289 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:17,411 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2022-07-14 06:40:17,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:40:17,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:40:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:17,413 INFO L225 Difference]: With dead ends: 158 [2022-07-14 06:40:17,413 INFO L226 Difference]: Without dead ends: 158 [2022-07-14 06:40:17,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:40:17,413 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 9 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:17,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 294 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:40:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-14 06:40:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-07-14 06:40:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 157 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2022-07-14 06:40:17,417 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 22 [2022-07-14 06:40:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:17,417 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2022-07-14 06:40:17,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2022-07-14 06:40:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:40:17,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:17,418 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] [2022-07-14 06:40:17,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 06:40:17,418 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:17,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:17,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1867739348, now seen corresponding path program 1 times [2022-07-14 06:40:17,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:17,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461827692] [2022-07-14 06:40:17,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:17,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,469 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-14 06:40:17,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:17,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461827692] [2022-07-14 06:40:17,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461827692] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:17,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:17,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:40:17,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029905441] [2022-07-14 06:40:17,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:17,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:40:17,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:17,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:40:17,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:40:17,471 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:17,612 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2022-07-14 06:40:17,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:40:17,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:40:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:17,614 INFO L225 Difference]: With dead ends: 157 [2022-07-14 06:40:17,614 INFO L226 Difference]: Without dead ends: 157 [2022-07-14 06:40:17,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:40:17,614 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:17,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 284 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:40:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-14 06:40:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-07-14 06:40:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 121 states have (on average 1.4297520661157024) internal successors, (173), 156 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2022-07-14 06:40:17,623 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 22 [2022-07-14 06:40:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:17,624 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2022-07-14 06:40:17,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2022-07-14 06:40:17,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:40:17,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:17,625 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] [2022-07-14 06:40:17,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 06:40:17,625 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:17,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:17,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1012469357, now seen corresponding path program 1 times [2022-07-14 06:40:17,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:17,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188169493] [2022-07-14 06:40:17,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:17,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,717 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-14 06:40:17,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:17,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188169493] [2022-07-14 06:40:17,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188169493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:17,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:17,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:40:17,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134076861] [2022-07-14 06:40:17,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:17,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:40:17,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:17,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:40:17,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:40:17,719 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:18,027 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2022-07-14 06:40:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:40:18,028 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-14 06:40:18,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:18,029 INFO L225 Difference]: With dead ends: 157 [2022-07-14 06:40:18,029 INFO L226 Difference]: Without dead ends: 157 [2022-07-14 06:40:18,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:40:18,030 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 140 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:18,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 273 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:40:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-14 06:40:18,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2022-07-14 06:40:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 121 states have (on average 1.421487603305785) internal successors, (172), 155 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2022-07-14 06:40:18,033 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 26 [2022-07-14 06:40:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:18,033 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2022-07-14 06:40:18,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2022-07-14 06:40:18,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:40:18,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:18,034 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] [2022-07-14 06:40:18,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 06:40:18,034 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:18,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:18,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1012469358, now seen corresponding path program 1 times [2022-07-14 06:40:18,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:18,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351596794] [2022-07-14 06:40:18,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:18,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:18,151 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-14 06:40:18,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:18,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351596794] [2022-07-14 06:40:18,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351596794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:18,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:18,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:40:18,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329386340] [2022-07-14 06:40:18,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:18,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:40:18,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:18,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:40:18,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:40:18,154 INFO L87 Difference]: Start difference. First operand 156 states and 172 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:18,542 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2022-07-14 06:40:18,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:40:18,542 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-14 06:40:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:18,543 INFO L225 Difference]: With dead ends: 156 [2022-07-14 06:40:18,543 INFO L226 Difference]: Without dead ends: 156 [2022-07-14 06:40:18,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:40:18,544 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 137 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:18,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 313 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:40:18,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-14 06:40:18,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2022-07-14 06:40:18,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.4049586776859504) internal successors, (170), 153 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:18,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2022-07-14 06:40:18,547 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 26 [2022-07-14 06:40:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:18,547 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2022-07-14 06:40:18,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2022-07-14 06:40:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:40:18,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:18,548 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:18,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 06:40:18,548 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash -560637622, now seen corresponding path program 1 times [2022-07-14 06:40:18,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:18,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771305610] [2022-07-14 06:40:18,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:18,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:18,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:18,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771305610] [2022-07-14 06:40:18,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771305610] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:40:18,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652117300] [2022-07-14 06:40:18,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:18,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:40:18,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:40:18,764 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-14 06:40:18,793 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-14 06:40:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:18,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-14 06:40:18,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:18,962 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-14 06:40:19,035 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:40:19,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:40:19,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:40:19,204 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:19,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:40:19,293 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:19,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:40:19,331 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:19,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 28 treesize of output 29 [2022-07-14 06:40:19,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:19,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:40:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:19,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:40:19,940 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:19,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-07-14 06:40:19,956 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:19,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2022-07-14 06:40:19,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 204 [2022-07-14 06:40:19,978 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:19,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 196 [2022-07-14 06:40:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:22,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652117300] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:40:22,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:40:22,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2022-07-14 06:40:22,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440037420] [2022-07-14 06:40:22,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:40:22,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-14 06:40:22,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:22,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-14 06:40:22,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1001, Unknown=19, NotChecked=0, Total=1190 [2022-07-14 06:40:22,144 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:22,816 INFO L93 Difference]: Finished difference Result 225 states and 248 transitions. [2022-07-14 06:40:22,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:40:22,816 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-14 06:40:22,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:22,817 INFO L225 Difference]: With dead ends: 225 [2022-07-14 06:40:22,817 INFO L226 Difference]: Without dead ends: 225 [2022-07-14 06:40:22,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=283, Invalid=1338, Unknown=19, NotChecked=0, Total=1640 [2022-07-14 06:40:22,819 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 517 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1065 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:22,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 847 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 899 Invalid, 0 Unknown, 1065 Unchecked, 0.5s Time] [2022-07-14 06:40:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-07-14 06:40:22,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 175. [2022-07-14 06:40:22,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 174 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 195 transitions. [2022-07-14 06:40:22,822 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 195 transitions. Word has length 29 [2022-07-14 06:40:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:22,823 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 195 transitions. [2022-07-14 06:40:22,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:22,823 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 195 transitions. [2022-07-14 06:40:22,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:40:22,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:22,823 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:22,852 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-14 06:40:23,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-14 06:40:23,036 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:23,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:23,036 INFO L85 PathProgramCache]: Analyzing trace with hash -560637621, now seen corresponding path program 1 times [2022-07-14 06:40:23,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:23,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991895120] [2022-07-14 06:40:23,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:23,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:23,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:23,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991895120] [2022-07-14 06:40:23,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991895120] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:40:23,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936783654] [2022-07-14 06:40:23,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:23,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:40:23,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:40:23,280 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-14 06:40:23,290 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-14 06:40:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:23,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-14 06:40:23,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:23,394 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-14 06:40:23,446 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:40:23,446 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-14 06:40:23,453 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-14 06:40:23,479 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-14 06:40:23,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:40:23,559 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:23,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:40:23,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:40:23,644 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:40:23,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, 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-14 06:40:23,649 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-14 06:40:23,661 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:23,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:40:23,697 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:40:23,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:40:23,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:23,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:40:23,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:23,873 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:23,873 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 16 [2022-07-14 06:40:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:23,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:40:24,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_589 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_81| Int) (v_ArrVal_588 (Array Int Int))) (or (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_588) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (and (<= (+ 4 .cse0) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_589) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (<= 0 .cse0))) (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-14 06:40:24,447 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |c_ULTIMATE.start_main_~head~0#1.offset|)) (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_584))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_585) .cse0 v_ArrVal_588) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_589) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))))) (forall ((v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_585) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_584) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))))) is different from false [2022-07-14 06:40:24,604 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:24,604 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 36 treesize of output 37 [2022-07-14 06:40:24,608 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:24,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:40:24,611 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 50 treesize of output 42 [2022-07-14 06:40:24,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:24,619 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 166 treesize of output 161 [2022-07-14 06:40:24,625 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 122 treesize of output 118 [2022-07-14 06:40:24,628 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 142 treesize of output 132 [2022-07-14 06:40:24,632 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 110 treesize of output 98 [2022-07-14 06:40:24,760 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:24,761 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 73 treesize of output 74 [2022-07-14 06:40:24,769 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:24,769 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 65 treesize of output 50 [2022-07-14 06:40:24,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:24,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:24,775 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2022-07-14 06:40:24,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:24,779 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-07-14 06:40:24,783 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-14 06:40:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:25,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936783654] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:40:25,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:40:25,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 38 [2022-07-14 06:40:25,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467296390] [2022-07-14 06:40:25,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:40:25,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-14 06:40:25,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:25,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-14 06:40:25,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1193, Unknown=14, NotChecked=142, Total=1482 [2022-07-14 06:40:25,086 INFO L87 Difference]: Start difference. First operand 175 states and 195 transitions. Second operand has 39 states, 38 states have (on average 2.236842105263158) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:26,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:26,616 INFO L93 Difference]: Finished difference Result 277 states and 306 transitions. [2022-07-14 06:40:26,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:40:26,616 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.236842105263158) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-14 06:40:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:26,617 INFO L225 Difference]: With dead ends: 277 [2022-07-14 06:40:26,617 INFO L226 Difference]: Without dead ends: 277 [2022-07-14 06:40:26,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=335, Invalid=2209, Unknown=14, NotChecked=198, Total=2756 [2022-07-14 06:40:26,619 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 366 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 997 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:26,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1659 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1755 Invalid, 0 Unknown, 997 Unchecked, 0.9s Time] [2022-07-14 06:40:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-14 06:40:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 173. [2022-07-14 06:40:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 146 states have (on average 1.356164383561644) internal successors, (198), 172 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2022-07-14 06:40:26,623 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 29 [2022-07-14 06:40:26,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:26,623 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2022-07-14 06:40:26,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.236842105263158) internal successors, (85), 39 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2022-07-14 06:40:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 06:40:26,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:26,625 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:26,654 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-14 06:40:26,851 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,SelfDestructingSolverStorable16 [2022-07-14 06:40:26,852 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:26,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:26,852 INFO L85 PathProgramCache]: Analyzing trace with hash -557177017, now seen corresponding path program 1 times [2022-07-14 06:40:26,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:26,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562682706] [2022-07-14 06:40:26,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:26,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:27,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:27,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562682706] [2022-07-14 06:40:27,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562682706] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:40:27,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524453524] [2022-07-14 06:40:27,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:27,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:40:27,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:40:27,015 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-14 06:40:27,043 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-14 06:40:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:27,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-14 06:40:27,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:27,129 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-14 06:40:27,184 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:40:27,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:40:27,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:40:27,300 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:27,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:40:27,384 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:27,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:40:27,405 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:27,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:40:27,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:27,535 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 31 treesize of output 26 [2022-07-14 06:40:27,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:27,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:40:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:27,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:40:27,919 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:27,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-07-14 06:40:27,927 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:27,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2022-07-14 06:40:27,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 204 [2022-07-14 06:40:27,951 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:27,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 196 [2022-07-14 06:40:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:34,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524453524] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:40:34,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:40:34,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 32 [2022-07-14 06:40:34,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380400922] [2022-07-14 06:40:34,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:40:34,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-14 06:40:34,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:34,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-14 06:40:34,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=883, Unknown=22, NotChecked=0, Total=1056 [2022-07-14 06:40:34,095 INFO L87 Difference]: Start difference. First operand 173 states and 198 transitions. Second operand has 33 states, 32 states have (on average 2.53125) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:34,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:34,675 INFO L93 Difference]: Finished difference Result 243 states and 274 transitions. [2022-07-14 06:40:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:40:34,675 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.53125) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-14 06:40:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:34,677 INFO L225 Difference]: With dead ends: 243 [2022-07-14 06:40:34,677 INFO L226 Difference]: Without dead ends: 243 [2022-07-14 06:40:34,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=245, Invalid=1215, Unknown=22, NotChecked=0, Total=1482 [2022-07-14 06:40:34,679 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 521 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 862 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:34,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1049 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 932 Invalid, 0 Unknown, 862 Unchecked, 0.4s Time] [2022-07-14 06:40:34,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-14 06:40:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 180. [2022-07-14 06:40:34,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 153 states have (on average 1.3529411764705883) internal successors, (207), 179 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:34,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 207 transitions. [2022-07-14 06:40:34,684 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 207 transitions. Word has length 31 [2022-07-14 06:40:34,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:34,684 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 207 transitions. [2022-07-14 06:40:34,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.53125) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 207 transitions. [2022-07-14 06:40:34,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 06:40:34,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:34,685 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:34,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:40:34,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 06:40:34,900 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:34,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:34,900 INFO L85 PathProgramCache]: Analyzing trace with hash -557177016, now seen corresponding path program 1 times [2022-07-14 06:40:34,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:34,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436016352] [2022-07-14 06:40:34,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:34,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:35,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:35,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436016352] [2022-07-14 06:40:35,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436016352] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:40:35,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811279599] [2022-07-14 06:40:35,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:35,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:40:35,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:40:35,100 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-14 06:40:35,128 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-14 06:40:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:35,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-14 06:40:35,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:35,223 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-14 06:40:35,279 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:40:35,279 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-14 06:40:35,283 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-14 06:40:35,306 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-14 06:40:35,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:40:35,408 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:35,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:40:35,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:40:35,501 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:40:35,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:40:35,507 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-14 06:40:35,523 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:35,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:40:35,577 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:35,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:40:35,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:40:35,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:35,709 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-14 06:40:35,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:35,714 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 31 treesize of output 26 [2022-07-14 06:40:35,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:35,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:40:35,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:35,744 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:35,744 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 16 [2022-07-14 06:40:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:35,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:40:35,918 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_89| 0) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|))) (and (<= (+ .cse0 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_817) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|))) (<= 0 (+ .cse0 8)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_89| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-14 06:40:36,154 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_89| 0) (and (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_814))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_813) .cse0 v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_817) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|)))))) (forall ((v_ArrVal_818 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_813) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|) 8)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_89| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-14 06:40:36,319 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:36,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-14 06:40:36,324 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:36,324 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 30 treesize of output 31 [2022-07-14 06:40:36,327 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 54 treesize of output 46 [2022-07-14 06:40:36,336 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:36,336 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 186 treesize of output 181 [2022-07-14 06:40:36,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 134 [2022-07-14 06:40:36,346 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 162 treesize of output 152 [2022-07-14 06:40:36,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 126 treesize of output 114 [2022-07-14 06:40:36,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:36,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-07-14 06:40:36,433 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:36,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 1 case distinctions, treesize of input 65 treesize of output 50 [2022-07-14 06:40:36,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:36,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:36,438 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2022-07-14 06:40:36,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:36,443 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-07-14 06:40:36,446 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-14 06:40:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:36,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811279599] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:40:36,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:40:36,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 34 [2022-07-14 06:40:36,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570182560] [2022-07-14 06:40:36,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:40:36,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-14 06:40:36,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:36,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-14 06:40:36,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=917, Unknown=13, NotChecked=126, Total=1190 [2022-07-14 06:40:36,663 INFO L87 Difference]: Start difference. First operand 180 states and 207 transitions. Second operand has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:37,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:37,564 INFO L93 Difference]: Finished difference Result 368 states and 410 transitions. [2022-07-14 06:40:37,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:40:37,565 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-14 06:40:37,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:37,566 INFO L225 Difference]: With dead ends: 368 [2022-07-14 06:40:37,566 INFO L226 Difference]: Without dead ends: 368 [2022-07-14 06:40:37,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=309, Invalid=1578, Unknown=13, NotChecked=170, Total=2070 [2022-07-14 06:40:37,567 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 546 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1173 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:37,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1023 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1148 Invalid, 0 Unknown, 1173 Unchecked, 0.6s Time] [2022-07-14 06:40:37,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-07-14 06:40:37,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 180. [2022-07-14 06:40:37,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 153 states have (on average 1.34640522875817) internal successors, (206), 179 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2022-07-14 06:40:37,572 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 31 [2022-07-14 06:40:37,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:37,572 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2022-07-14 06:40:37,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:37,572 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2022-07-14 06:40:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 06:40:37,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:37,573 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] [2022-07-14 06:40:37,599 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-14 06:40:37,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:40:37,791 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:37,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:37,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1435398869, now seen corresponding path program 1 times [2022-07-14 06:40:37,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:37,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65518565] [2022-07-14 06:40:37,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:40:37,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:37,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65518565] [2022-07-14 06:40:37,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65518565] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:40:37,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029548009] [2022-07-14 06:40:37,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:37,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:40:37,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:40:37,864 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-14 06:40:37,872 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-14 06:40:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:37,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 06:40:37,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:38,033 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 17 [2022-07-14 06:40:38,035 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 13 [2022-07-14 06:40:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:40:38,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:40:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:40:38,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029548009] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:40:38,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:40:38,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2022-07-14 06:40:38,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544838456] [2022-07-14 06:40:38,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:40:38,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 06:40:38,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:38,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 06:40:38,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:40:38,162 INFO L87 Difference]: Start difference. First operand 180 states and 206 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:38,597 INFO L93 Difference]: Finished difference Result 184 states and 203 transitions. [2022-07-14 06:40:38,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:40:38,598 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-14 06:40:38,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:38,598 INFO L225 Difference]: With dead ends: 184 [2022-07-14 06:40:38,598 INFO L226 Difference]: Without dead ends: 184 [2022-07-14 06:40:38,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2022-07-14 06:40:38,599 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 270 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:38,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 278 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:40:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-14 06:40:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 168. [2022-07-14 06:40:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.3216783216783217) internal successors, (189), 167 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 189 transitions. [2022-07-14 06:40:38,603 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 189 transitions. Word has length 34 [2022-07-14 06:40:38,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:38,603 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 189 transitions. [2022-07-14 06:40:38,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:38,603 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 189 transitions. [2022-07-14 06:40:38,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 06:40:38,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:38,604 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:38,626 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-14 06:40:38,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:40:38,824 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:38,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:38,824 INFO L85 PathProgramCache]: Analyzing trace with hash -605799936, now seen corresponding path program 1 times [2022-07-14 06:40:38,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:38,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812159637] [2022-07-14 06:40:38,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:38,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:39,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:39,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812159637] [2022-07-14 06:40:39,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812159637] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:40:39,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882183173] [2022-07-14 06:40:39,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:39,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:40:39,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:40:39,008 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-14 06:40:39,009 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-14 06:40:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:39,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-14 06:40:39,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:39,253 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:40:39,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:40:39,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:40:39,390 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:39,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:40:39,485 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:39,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:40:39,511 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:39,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 28 treesize of output 29 [2022-07-14 06:40:39,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:39,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:40:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:39,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:40:40,055 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:40,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-07-14 06:40:40,063 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:40,063 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 144 treesize of output 131 [2022-07-14 06:40:40,073 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:40,073 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 116 treesize of output 114 [2022-07-14 06:40:40,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2022-07-14 06:40:42,666 INFO L356 Elim1Store]: treesize reduction 18, result has 63.3 percent of original size [2022-07-14 06:40:42,667 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 46 treesize of output 68 [2022-07-14 06:40:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:42,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882183173] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:40:42,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:40:42,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 36 [2022-07-14 06:40:42,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554988040] [2022-07-14 06:40:42,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:40:42,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-14 06:40:42,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-14 06:40:42,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1142, Unknown=22, NotChecked=0, Total=1332 [2022-07-14 06:40:42,771 INFO L87 Difference]: Start difference. First operand 168 states and 189 transitions. Second operand has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 37 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:43,282 INFO L93 Difference]: Finished difference Result 237 states and 263 transitions. [2022-07-14 06:40:43,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 06:40:43,283 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 37 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-14 06:40:43,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:43,284 INFO L225 Difference]: With dead ends: 237 [2022-07-14 06:40:43,284 INFO L226 Difference]: Without dead ends: 237 [2022-07-14 06:40:43,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=298, Invalid=1572, Unknown=22, NotChecked=0, Total=1892 [2022-07-14 06:40:43,285 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 355 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 986 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:43,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 890 Invalid, 1821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 780 Invalid, 0 Unknown, 986 Unchecked, 0.3s Time] [2022-07-14 06:40:43,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-14 06:40:43,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 201. [2022-07-14 06:40:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 176 states have (on average 1.2897727272727273) internal successors, (227), 200 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 227 transitions. [2022-07-14 06:40:43,289 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 227 transitions. Word has length 36 [2022-07-14 06:40:43,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:43,289 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 227 transitions. [2022-07-14 06:40:43,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 37 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 227 transitions. [2022-07-14 06:40:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 06:40:43,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:43,290 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:43,309 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-14 06:40:43,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:40:43,499 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:43,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:43,500 INFO L85 PathProgramCache]: Analyzing trace with hash -605799935, now seen corresponding path program 1 times [2022-07-14 06:40:43,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:43,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207796746] [2022-07-14 06:40:43,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:43,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:43,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:43,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207796746] [2022-07-14 06:40:43,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207796746] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:40:43,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605219065] [2022-07-14 06:40:43,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:43,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:40:43,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:40:43,764 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-14 06:40:43,765 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-14 06:40:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:43,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-14 06:40:43,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:43,991 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-14 06:40:44,017 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:40:44,017 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-14 06:40:44,057 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-14 06:40:44,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:40:44,168 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:44,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:40:44,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:40:44,282 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:44,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:40:44,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:44,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 14 treesize of output 16 [2022-07-14 06:40:44,312 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:44,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:40:44,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:40:44,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:44,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:40:44,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:44,419 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:44,419 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 16 [2022-07-14 06:40:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:44,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:40:44,661 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_103| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1187) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|))) (and (<= 0 .cse0) (<= (+ .cse0 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_103| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-14 06:40:44,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_103| Int) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (and (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1183))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1182) .cse0 v_ArrVal_1187) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1186) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|)))))) (forall ((v_ArrVal_1187 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1182) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1183) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1187) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_103| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-14 06:40:45,101 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:45,102 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 36 treesize of output 37 [2022-07-14 06:40:45,106 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:45,106 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 28 treesize of output 29 [2022-07-14 06:40:45,108 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 50 treesize of output 42 [2022-07-14 06:40:45,115 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:45,115 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 100 treesize of output 99 [2022-07-14 06:40:45,124 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 60 treesize of output 52 [2022-07-14 06:40:45,128 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 76 treesize of output 70 [2022-07-14 06:40:45,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-07-14 06:40:45,187 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:45,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-07-14 06:40:45,196 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:45,196 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 65 treesize of output 50 [2022-07-14 06:40:45,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:45,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:45,200 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2022-07-14 06:40:45,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:45,203 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-07-14 06:40:45,206 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-14 06:40:45,560 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:40:45,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:40:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:45,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605219065] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:40:45,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:40:45,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 16] total 40 [2022-07-14 06:40:45,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887767477] [2022-07-14 06:40:45,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:40:45,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-14 06:40:45,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:45,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-14 06:40:45,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1318, Unknown=28, NotChecked=150, Total=1640 [2022-07-14 06:40:45,630 INFO L87 Difference]: Start difference. First operand 201 states and 227 transitions. Second operand has 41 states, 40 states have (on average 2.475) internal successors, (99), 41 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:46,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:46,744 INFO L93 Difference]: Finished difference Result 301 states and 330 transitions. [2022-07-14 06:40:46,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 06:40:46,746 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.475) internal successors, (99), 41 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-14 06:40:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:46,747 INFO L225 Difference]: With dead ends: 301 [2022-07-14 06:40:46,747 INFO L226 Difference]: Without dead ends: 301 [2022-07-14 06:40:46,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=409, Invalid=2650, Unknown=29, NotChecked=218, Total=3306 [2022-07-14 06:40:46,748 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 409 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 796 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:46,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1055 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1273 Invalid, 0 Unknown, 796 Unchecked, 0.5s Time] [2022-07-14 06:40:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-14 06:40:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 200. [2022-07-14 06:40:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 175 states have (on average 1.2857142857142858) internal successors, (225), 199 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 225 transitions. [2022-07-14 06:40:46,752 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 225 transitions. Word has length 36 [2022-07-14 06:40:46,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:46,752 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 225 transitions. [2022-07-14 06:40:46,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.475) internal successors, (99), 41 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 225 transitions. [2022-07-14 06:40:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 06:40:46,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:46,753 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] [2022-07-14 06:40:46,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-14 06:40:46,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:40:46,970 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-07-14 06:40:46,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:46,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1311673304, now seen corresponding path program 2 times [2022-07-14 06:40:46,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:46,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432629182] [2022-07-14 06:40:46,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:46,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:47,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432629182] [2022-07-14 06:40:47,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432629182] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:40:47,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762072597] [2022-07-14 06:40:47,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:40:47,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:40:47,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:40:47,331 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-14 06:40:47,332 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-14 06:40:47,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:40:47,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:40:47,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-14 06:40:47,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:47,447 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-14 06:40:47,498 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:40:47,499 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-14 06:40:47,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:40:47,536 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-14 06:40:47,610 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:47,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-14 06:40:47,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:40:47,692 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 06:40:47,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2022-07-14 06:40:47,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:47,705 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 06:40:47,705 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 22 [2022-07-14 06:40:47,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:47,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:47,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:47,746 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:40:47,747 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 1 case distinctions, treesize of input 89 treesize of output 70 [2022-07-14 06:40:47,754 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-14 06:40:47,754 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2022-07-14 06:40:48,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:48,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:48,009 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:48,013 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-07-14 06:40:48,013 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 5 case distinctions, treesize of input 69 treesize of output 42 [2022-07-14 06:40:48,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:48,020 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:40:48,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 22 [2022-07-14 06:40:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:48,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:40:56,399 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:56,400 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 300 treesize of output 245 [2022-07-14 06:40:56,460 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:56,461 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 3764 treesize of output 3700 [2022-07-14 06:40:56,492 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:56,493 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 8862 treesize of output 8606