./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0513.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 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/memsafety/test-0513.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 aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 05:55:53,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:55:53,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:55:53,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:55:53,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:55:53,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:55:53,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:55:53,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:55:53,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:55:53,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:55:53,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:55:53,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:55:53,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:55:53,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:55:53,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:55:53,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:55:53,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:55:53,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:55:53,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:55:53,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:55:53,881 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:55:53,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:55:53,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:55:53,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:55:53,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:55:53,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:55:53,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:55:53,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:55:53,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:55:53,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:55:53,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:55:53,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:55:53,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:55:53,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:55:53,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:55:53,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:55:53,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:55:53,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:55:53,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:55:53,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:55:53,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:55:53,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:55:53,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 05:55:53,925 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:55:53,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:55:53,932 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:55:53,933 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:55:53,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:55:53,934 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:55:53,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:55:53,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:55:53,934 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:55:53,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:55:53,936 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:55:53,936 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:55:53,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:55:53,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:55:53,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:55:53,937 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:55:53,937 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:55:53,937 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 05:55:53,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:55:53,937 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:55:53,937 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:55:53,938 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:55:53,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:55:53,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:55:53,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:55:53,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:55:53,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:55:53,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:55:53,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 05:55:53,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 05:55:53,940 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 -> aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e [2022-07-23 05:55:54,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:55:54,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:55:54,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:55:54,171 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:55:54,171 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:55:54,172 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0513.i [2022-07-23 05:55:54,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28dd00b59/9e04cf8bc9cf41ac9ee876bffc8e3b92/FLAG13aa92b84 [2022-07-23 05:55:54,674 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:55:54,676 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0513.i [2022-07-23 05:55:54,692 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28dd00b59/9e04cf8bc9cf41ac9ee876bffc8e3b92/FLAG13aa92b84 [2022-07-23 05:55:54,708 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28dd00b59/9e04cf8bc9cf41ac9ee876bffc8e3b92 [2022-07-23 05:55:54,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:55:54,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:55:54,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:55:54,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:55:54,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:55:54,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:55:54" (1/1) ... [2022-07-23 05:55:54,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@520c1d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:55:54, skipping insertion in model container [2022-07-23 05:55:54,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:55:54" (1/1) ... [2022-07-23 05:55:54,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:55:54,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:55:55,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:55:55,056 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 05:55:55,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:55:55,110 INFO L208 MainTranslator]: Completed translation [2022-07-23 05:55:55,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:55:55 WrapperNode [2022-07-23 05:55:55,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:55:55,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 05:55:55,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 05:55:55,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 05:55:55,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:55:55" (1/1) ... [2022-07-23 05:55:55,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:55:55" (1/1) ... [2022-07-23 05:55:55,148 INFO L137 Inliner]: procedures = 123, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2022-07-23 05:55:55,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 05:55:55,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 05:55:55,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 05:55:55,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 05:55:55,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:55:55" (1/1) ... [2022-07-23 05:55:55,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:55:55" (1/1) ... [2022-07-23 05:55:55,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:55:55" (1/1) ... [2022-07-23 05:55:55,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:55:55" (1/1) ... [2022-07-23 05:55:55,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:55:55" (1/1) ... [2022-07-23 05:55:55,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:55:55" (1/1) ... [2022-07-23 05:55:55,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:55:55" (1/1) ... [2022-07-23 05:55:55,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 05:55:55,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 05:55:55,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 05:55:55,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 05:55:55,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:55:55" (1/1) ... [2022-07-23 05:55:55,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:55:55,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:55:55,207 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-23 05:55:55,210 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-23 05:55:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 05:55:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 05:55:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 05:55:55,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 05:55:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 05:55:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 05:55:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 05:55:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 05:55:55,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 05:55:55,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 05:55:55,308 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 05:55:55,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 05:55:55,666 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 05:55:55,678 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 05:55:55,680 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-23 05:55:55,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:55:55 BoogieIcfgContainer [2022-07-23 05:55:55,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 05:55:55,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 05:55:55,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 05:55:55,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 05:55:55,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 05:55:54" (1/3) ... [2022-07-23 05:55:55,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ab4a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:55:55, skipping insertion in model container [2022-07-23 05:55:55,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:55:55" (2/3) ... [2022-07-23 05:55:55,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ab4a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:55:55, skipping insertion in model container [2022-07-23 05:55:55,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:55:55" (3/3) ... [2022-07-23 05:55:55,691 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0513.i [2022-07-23 05:55:55,703 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 05:55:55,703 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-07-23 05:55:55,762 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 05:55:55,767 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@565ecfc0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2ea56891 [2022-07-23 05:55:55,768 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2022-07-23 05:55:55,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 69 states have (on average 2.101449275362319) internal successors, (145), 131 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 05:55:55,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:55:55,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 05:55:55,784 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:55:55,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:55:55,788 INFO L85 PathProgramCache]: Analyzing trace with hash 28740643, now seen corresponding path program 1 times [2022-07-23 05:55:55,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:55:55,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464044423] [2022-07-23 05:55:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:55:55,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:55:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:55:55,914 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-23 05:55:55,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:55:55,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464044423] [2022-07-23 05:55:55,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464044423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:55:55,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:55:55,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:55:55,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076765007] [2022-07-23 05:55:55,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:55:55,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-23 05:55:55,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:55:55,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 05:55:55,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 05:55:55,951 INFO L87 Difference]: Start difference. First operand has 132 states, 69 states have (on average 2.101449275362319) internal successors, (145), 131 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:55:55,965 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2022-07-23 05:55:55,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 05:55:55,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-23 05:55:55,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:55:55,973 INFO L225 Difference]: With dead ends: 132 [2022-07-23 05:55:55,973 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 05:55:55,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 05:55:55,977 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:55:55,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:55:55,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 05:55:56,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-23 05:55:56,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 2.0294117647058822) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2022-07-23 05:55:56,007 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 5 [2022-07-23 05:55:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:55:56,007 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2022-07-23 05:55:56,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2022-07-23 05:55:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 05:55:56,008 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:55:56,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 05:55:56,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 05:55:56,009 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:55:56,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:55:56,009 INFO L85 PathProgramCache]: Analyzing trace with hash 889570808, now seen corresponding path program 1 times [2022-07-23 05:55:56,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:55:56,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053106520] [2022-07-23 05:55:56,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:55:56,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:55:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:55:56,039 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-23 05:55:56,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:55:56,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053106520] [2022-07-23 05:55:56,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053106520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:55:56,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:55:56,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:55:56,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636696139] [2022-07-23 05:55:56,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:55:56,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:55:56,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:55:56,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:55:56,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:55:56,042 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:55:56,143 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2022-07-23 05:55:56,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:55:56,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-23 05:55:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:55:56,145 INFO L225 Difference]: With dead ends: 176 [2022-07-23 05:55:56,145 INFO L226 Difference]: Without dead ends: 175 [2022-07-23 05:55:56,146 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-23 05:55:56,147 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:55:56,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 192 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:55:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-23 05:55:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 133. [2022-07-23 05:55:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 71 states have (on average 2.0) internal successors, (142), 132 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2022-07-23 05:55:56,158 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 6 [2022-07-23 05:55:56,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:55:56,158 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2022-07-23 05:55:56,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2022-07-23 05:55:56,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 05:55:56,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:55:56,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 05:55:56,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 05:55:56,159 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:55:56,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:55:56,160 INFO L85 PathProgramCache]: Analyzing trace with hash 889570732, now seen corresponding path program 1 times [2022-07-23 05:55:56,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:55:56,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609298771] [2022-07-23 05:55:56,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:55:56,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:55:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:55:56,189 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-23 05:55:56,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:55:56,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609298771] [2022-07-23 05:55:56,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609298771] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:55:56,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:55:56,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:55:56,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536719470] [2022-07-23 05:55:56,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:55:56,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:55:56,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:55:56,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:55:56,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:55:56,192 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:55:56,251 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2022-07-23 05:55:56,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:55:56,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-23 05:55:56,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:55:56,255 INFO L225 Difference]: With dead ends: 145 [2022-07-23 05:55:56,256 INFO L226 Difference]: Without dead ends: 144 [2022-07-23 05:55:56,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:55:56,263 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 15 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:55:56,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 229 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:55:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-23 05:55:56,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2022-07-23 05:55:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 137 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2022-07-23 05:55:56,277 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 6 [2022-07-23 05:55:56,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:55:56,277 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2022-07-23 05:55:56,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,278 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2022-07-23 05:55:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 05:55:56,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:55:56,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 05:55:56,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 05:55:56,279 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:55:56,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:55:56,280 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2022-07-23 05:55:56,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:55:56,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816899924] [2022-07-23 05:55:56,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:55:56,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:55:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:55:56,323 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-23 05:55:56,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:55:56,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816899924] [2022-07-23 05:55:56,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816899924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:55:56,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:55:56,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:55:56,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000718815] [2022-07-23 05:55:56,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:55:56,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:55:56,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:55:56,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:55:56,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:55:56,326 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:55:56,446 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2022-07-23 05:55:56,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:55:56,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-23 05:55:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:55:56,449 INFO L225 Difference]: With dead ends: 169 [2022-07-23 05:55:56,449 INFO L226 Difference]: Without dead ends: 169 [2022-07-23 05:55:56,450 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-23 05:55:56,455 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 75 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:55:56,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 167 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:55:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-23 05:55:56,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 139. [2022-07-23 05:55:56,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 80 states have (on average 1.9125) internal successors, (153), 138 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2022-07-23 05:55:56,466 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 6 [2022-07-23 05:55:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:55:56,466 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2022-07-23 05:55:56,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2022-07-23 05:55:56,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 05:55:56,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:55:56,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 05:55:56,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 05:55:56,468 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:55:56,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:55:56,468 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2022-07-23 05:55:56,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:55:56,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460308101] [2022-07-23 05:55:56,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:55:56,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:55:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:55:56,506 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-23 05:55:56,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:55:56,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460308101] [2022-07-23 05:55:56,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460308101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:55:56,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:55:56,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:55:56,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358006347] [2022-07-23 05:55:56,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:55:56,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:55:56,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:55:56,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:55:56,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:55:56,508 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:55:56,603 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2022-07-23 05:55:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:55:56,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-23 05:55:56,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:55:56,604 INFO L225 Difference]: With dead ends: 137 [2022-07-23 05:55:56,604 INFO L226 Difference]: Without dead ends: 137 [2022-07-23 05:55:56,605 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-23 05:55:56,610 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 22 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:55:56,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 173 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:55:56,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-23 05:55:56,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-07-23 05:55:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.8625) internal successors, (149), 136 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-23 05:55:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2022-07-23 05:55:56,625 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 6 [2022-07-23 05:55:56,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:55:56,625 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2022-07-23 05:55:56,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2022-07-23 05:55:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:55:56,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:55:56,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:55:56,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 05:55:56,626 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:55:56,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:55:56,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2119659887, now seen corresponding path program 1 times [2022-07-23 05:55:56,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:55:56,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304098401] [2022-07-23 05:55:56,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:55:56,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:55:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:55:56,666 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-23 05:55:56,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:55:56,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304098401] [2022-07-23 05:55:56,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304098401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:55:56,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:55:56,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:55:56,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267664150] [2022-07-23 05:55:56,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:55:56,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:55:56,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:55:56,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:55:56,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:55:56,668 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:55:56,740 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2022-07-23 05:55:56,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:55:56,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 05:55:56,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:55:56,742 INFO L225 Difference]: With dead ends: 133 [2022-07-23 05:55:56,742 INFO L226 Difference]: Without dead ends: 133 [2022-07-23 05:55:56,743 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-23 05:55:56,745 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 23 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:55:56,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 168 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:55:56,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-23 05:55:56,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-07-23 05:55:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.8125) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-07-23 05:55:56,758 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2022-07-23 05:55:56,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:55:56,758 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-07-23 05:55:56,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-07-23 05:55:56,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:55:56,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:55:56,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:55:56,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 05:55:56,760 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:55:56,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:55:56,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2119659886, now seen corresponding path program 1 times [2022-07-23 05:55:56,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:55:56,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794168372] [2022-07-23 05:55:56,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:55:56,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:55:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:55:56,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:55:56,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:55:56,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794168372] [2022-07-23 05:55:56,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794168372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:55:56,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:55:56,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:55:56,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001597456] [2022-07-23 05:55:56,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:55:56,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:55:56,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:55:56,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:55:56,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:55:56,816 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:55:56,882 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-07-23 05:55:56,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:55:56,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 05:55:56,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:55:56,883 INFO L225 Difference]: With dead ends: 130 [2022-07-23 05:55:56,884 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 05:55:56,884 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-23 05:55:56,885 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:55:56,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 179 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:55:56,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 05:55:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-23 05:55:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.775) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2022-07-23 05:55:56,890 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 11 [2022-07-23 05:55:56,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:55:56,890 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2022-07-23 05:55:56,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:56,890 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-07-23 05:55:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:55:56,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:55:56,891 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:55:56,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 05:55:56,892 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:55:56,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:55:56,893 INFO L85 PathProgramCache]: Analyzing trace with hash -967503371, now seen corresponding path program 1 times [2022-07-23 05:55:56,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:55:56,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119462185] [2022-07-23 05:55:56,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:55:56,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:55:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:55:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:55:56,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:55:56,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119462185] [2022-07-23 05:55:56,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119462185] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:55:56,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:55:56,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:55:56,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610043073] [2022-07-23 05:55:56,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:55:56,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:55:56,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:55:56,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:55:56,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:55:56,985 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:55:57,076 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2022-07-23 05:55:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:55:57,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-23 05:55:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:55:57,078 INFO L225 Difference]: With dead ends: 228 [2022-07-23 05:55:57,078 INFO L226 Difference]: Without dead ends: 228 [2022-07-23 05:55:57,078 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-23 05:55:57,080 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 126 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:55:57,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 251 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:55:57,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-23 05:55:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 130. [2022-07-23 05:55:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.75) internal successors, (140), 129 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-23 05:55:57,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2022-07-23 05:55:57,088 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 18 [2022-07-23 05:55:57,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:55:57,089 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2022-07-23 05:55:57,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2022-07-23 05:55:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:55:57,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:55:57,090 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:55:57,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 05:55:57,093 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:55:57,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:55:57,093 INFO L85 PathProgramCache]: Analyzing trace with hash -967503447, now seen corresponding path program 1 times [2022-07-23 05:55:57,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:55:57,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922053107] [2022-07-23 05:55:57,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:55:57,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:55:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:55:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:55:57,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:55:57,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922053107] [2022-07-23 05:55:57,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922053107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:55:57,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:55:57,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:55:57,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487568783] [2022-07-23 05:55:57,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:55:57,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:55:57,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:55:57,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:55:57,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:55:57,156 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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-23 05:55:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:55:57,297 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2022-07-23 05:55:57,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:55:57,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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-23 05:55:57,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:55:57,300 INFO L225 Difference]: With dead ends: 124 [2022-07-23 05:55:57,300 INFO L226 Difference]: Without dead ends: 124 [2022-07-23 05:55:57,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:55:57,301 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 46 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:55:57,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 213 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:55:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-23 05:55:57,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-07-23 05:55:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.654320987654321) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2022-07-23 05:55:57,305 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 18 [2022-07-23 05:55:57,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:55:57,305 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2022-07-23 05:55:57,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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-23 05:55:57,305 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2022-07-23 05:55:57,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:55:57,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:55:57,306 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:55:57,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 05:55:57,307 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:55:57,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:55:57,307 INFO L85 PathProgramCache]: Analyzing trace with hash -967503446, now seen corresponding path program 1 times [2022-07-23 05:55:57,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:55:57,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761311786] [2022-07-23 05:55:57,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:55:57,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:55:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:55:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:55:57,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:55:57,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761311786] [2022-07-23 05:55:57,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761311786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:55:57,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:55:57,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:55:57,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528414580] [2022-07-23 05:55:57,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:55:57,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:55:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:55:57,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:55:57,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:55:57,374 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:55:57,514 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2022-07-23 05:55:57,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:55:57,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-23 05:55:57,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:55:57,515 INFO L225 Difference]: With dead ends: 204 [2022-07-23 05:55:57,516 INFO L226 Difference]: Without dead ends: 204 [2022-07-23 05:55:57,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-23 05:55:57,517 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:55:57,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 168 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:55:57,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-23 05:55:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 162. [2022-07-23 05:55:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 122 states have (on average 1.680327868852459) internal successors, (205), 161 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 205 transitions. [2022-07-23 05:55:57,521 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 205 transitions. Word has length 18 [2022-07-23 05:55:57,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:55:57,522 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 205 transitions. [2022-07-23 05:55:57,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 205 transitions. [2022-07-23 05:55:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 05:55:57,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:55:57,523 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] [2022-07-23 05:55:57,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 05:55:57,523 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:55:57,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:55:57,524 INFO L85 PathProgramCache]: Analyzing trace with hash 199814016, now seen corresponding path program 1 times [2022-07-23 05:55:57,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:55:57,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406383208] [2022-07-23 05:55:57,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:55:57,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:55:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:55:57,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:55:57,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:55:57,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406383208] [2022-07-23 05:55:57,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406383208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:55:57,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:55:57,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:55:57,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465852607] [2022-07-23 05:55:57,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:55:57,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:55:57,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:55:57,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:55:57,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:55:57,582 INFO L87 Difference]: Start difference. First operand 162 states and 205 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:55:57,700 INFO L93 Difference]: Finished difference Result 205 states and 224 transitions. [2022-07-23 05:55:57,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:55:57,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-23 05:55:57,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:55:57,702 INFO L225 Difference]: With dead ends: 205 [2022-07-23 05:55:57,702 INFO L226 Difference]: Without dead ends: 205 [2022-07-23 05:55:57,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:55:57,706 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 225 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:55:57,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 309 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:55:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-23 05:55:57,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 163. [2022-07-23 05:55:57,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 162 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-23 05:55:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 206 transitions. [2022-07-23 05:55:57,711 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 206 transitions. Word has length 23 [2022-07-23 05:55:57,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:55:57,712 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 206 transitions. [2022-07-23 05:55:57,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2022-07-23 05:55:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 05:55:57,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:55:57,716 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] [2022-07-23 05:55:57,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 05:55:57,716 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:55:57,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:55:57,717 INFO L85 PathProgramCache]: Analyzing trace with hash 198674982, now seen corresponding path program 1 times [2022-07-23 05:55:57,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:55:57,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942053369] [2022-07-23 05:55:57,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:55:57,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:55:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:55:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:55:57,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:55:57,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942053369] [2022-07-23 05:55:57,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942053369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:55:57,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:55:57,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:55:57,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747719765] [2022-07-23 05:55:57,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:55:57,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:55:57,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:55:57,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:55:57,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:55:57,862 INFO L87 Difference]: Start difference. First operand 163 states and 206 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:55:57,995 INFO L93 Difference]: Finished difference Result 191 states and 235 transitions. [2022-07-23 05:55:57,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:55:57,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-23 05:55:57,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:55:57,996 INFO L225 Difference]: With dead ends: 191 [2022-07-23 05:55:57,996 INFO L226 Difference]: Without dead ends: 191 [2022-07-23 05:55:57,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:55:57,997 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 23 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:55:57,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 399 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:55:57,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-23 05:55:58,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2022-07-23 05:55:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 130 states have (on average 1.646153846153846) internal successors, (214), 169 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2022-07-23 05:55:58,001 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 23 [2022-07-23 05:55:58,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:55:58,001 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2022-07-23 05:55:58,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:58,001 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2022-07-23 05:55:58,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 05:55:58,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:55:58,002 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:55:58,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 05:55:58,002 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:55:58,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:55:58,003 INFO L85 PathProgramCache]: Analyzing trace with hash -165115758, now seen corresponding path program 1 times [2022-07-23 05:55:58,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:55:58,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002512838] [2022-07-23 05:55:58,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:55:58,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:55:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:55:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:55:58,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:55:58,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002512838] [2022-07-23 05:55:58,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002512838] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:55:58,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:55:58,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 05:55:58,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609857644] [2022-07-23 05:55:58,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:55:58,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 05:55:58,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:55:58,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 05:55:58,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-23 05:55:58,249 INFO L87 Difference]: Start difference. First operand 170 states and 214 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:58,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:55:58,739 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2022-07-23 05:55:58,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 05:55:58,739 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-23 05:55:58,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:55:58,740 INFO L225 Difference]: With dead ends: 228 [2022-07-23 05:55:58,740 INFO L226 Difference]: Without dead ends: 228 [2022-07-23 05:55:58,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-07-23 05:55:58,741 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 127 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:55:58,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 491 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 05:55:58,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-23 05:55:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 177. [2022-07-23 05:55:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6277372262773722) internal successors, (223), 176 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2022-07-23 05:55:58,745 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 26 [2022-07-23 05:55:58,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:55:58,745 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2022-07-23 05:55:58,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-07-23 05:55:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 05:55:58,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:55:58,746 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:55:58,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 05:55:58,746 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:55:58,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:55:58,747 INFO L85 PathProgramCache]: Analyzing trace with hash -165115757, now seen corresponding path program 1 times [2022-07-23 05:55:58,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:55:58,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054965912] [2022-07-23 05:55:58,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:55:58,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:55:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:55:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:55:58,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:55:58,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054965912] [2022-07-23 05:55:58,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054965912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:55:58,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:55:58,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 05:55:58,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266949330] [2022-07-23 05:55:58,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:55:58,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 05:55:58,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:55:58,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 05:55:58,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:55:58,979 INFO L87 Difference]: Start difference. First operand 177 states and 223 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-23 05:55:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:55:59,354 INFO L93 Difference]: Finished difference Result 207 states and 251 transitions. [2022-07-23 05:55:59,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 05:55:59,354 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-23 05:55:59,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:55:59,355 INFO L225 Difference]: With dead ends: 207 [2022-07-23 05:55:59,355 INFO L226 Difference]: Without dead ends: 207 [2022-07-23 05:55:59,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-23 05:55:59,356 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 75 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:55:59,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 353 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:55:59,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-23 05:55:59,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 177. [2022-07-23 05:55:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6204379562043796) internal successors, (222), 176 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:59,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 222 transitions. [2022-07-23 05:55:59,360 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 222 transitions. Word has length 26 [2022-07-23 05:55:59,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:55:59,360 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 222 transitions. [2022-07-23 05:55:59,361 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-23 05:55:59,361 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 222 transitions. [2022-07-23 05:55:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 05:55:59,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:55:59,362 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:55:59,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 05:55:59,362 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:55:59,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:55:59,362 INFO L85 PathProgramCache]: Analyzing trace with hash -823622550, now seen corresponding path program 1 times [2022-07-23 05:55:59,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:55:59,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855589219] [2022-07-23 05:55:59,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:55:59,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:55:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:55:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:55:59,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:55:59,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855589219] [2022-07-23 05:55:59,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855589219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:55:59,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:55:59,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 05:55:59,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455843431] [2022-07-23 05:55:59,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:55:59,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 05:55:59,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:55:59,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 05:55:59,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:55:59,495 INFO L87 Difference]: Start difference. First operand 177 states and 222 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:55:59,652 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2022-07-23 05:55:59,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 05:55:59,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 05:55:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:55:59,654 INFO L225 Difference]: With dead ends: 194 [2022-07-23 05:55:59,654 INFO L226 Difference]: Without dead ends: 194 [2022-07-23 05:55:59,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-23 05:55:59,655 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 44 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:55:59,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 406 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:55:59,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-23 05:55:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2022-07-23 05:55:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6131386861313868) internal successors, (221), 176 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 221 transitions. [2022-07-23 05:55:59,658 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 221 transitions. Word has length 27 [2022-07-23 05:55:59,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:55:59,658 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 221 transitions. [2022-07-23 05:55:59,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:55:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 221 transitions. [2022-07-23 05:55:59,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 05:55:59,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:55:59,659 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] [2022-07-23 05:55:59,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 05:55:59,659 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:55:59,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:55:59,660 INFO L85 PathProgramCache]: Analyzing trace with hash 237551634, now seen corresponding path program 1 times [2022-07-23 05:55:59,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:55:59,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475969365] [2022-07-23 05:55:59,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:55:59,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:55:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:55:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:55:59,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:55:59,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475969365] [2022-07-23 05:55:59,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475969365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:55:59,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:55:59,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 05:55:59,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442102301] [2022-07-23 05:55:59,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:55:59,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 05:55:59,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:55:59,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 05:55:59,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:55:59,767 INFO L87 Difference]: Start difference. First operand 177 states and 221 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:00,033 INFO L93 Difference]: Finished difference Result 229 states and 275 transitions. [2022-07-23 05:56:00,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 05:56:00,034 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-23 05:56:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:00,035 INFO L225 Difference]: With dead ends: 229 [2022-07-23 05:56:00,035 INFO L226 Difference]: Without dead ends: 229 [2022-07-23 05:56:00,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-23 05:56:00,036 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 172 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:00,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 569 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:56:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-23 05:56:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 179. [2022-07-23 05:56:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.60431654676259) internal successors, (223), 178 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 223 transitions. [2022-07-23 05:56:00,040 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 223 transitions. Word has length 28 [2022-07-23 05:56:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:00,040 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 223 transitions. [2022-07-23 05:56:00,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 223 transitions. [2022-07-23 05:56:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 05:56:00,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:00,041 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-23 05:56:00,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 05:56:00,041 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:56:00,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1225833714, now seen corresponding path program 1 times [2022-07-23 05:56:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:00,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073212736] [2022-07-23 05:56:00,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:00,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:00,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:00,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073212736] [2022-07-23 05:56:00,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073212736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:00,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:56:00,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 05:56:00,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149459679] [2022-07-23 05:56:00,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:00,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 05:56:00,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:00,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 05:56:00,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:56:00,178 INFO L87 Difference]: Start difference. First operand 179 states and 223 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:00,431 INFO L93 Difference]: Finished difference Result 200 states and 244 transitions. [2022-07-23 05:56:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 05:56:00,431 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-23 05:56:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:00,432 INFO L225 Difference]: With dead ends: 200 [2022-07-23 05:56:00,432 INFO L226 Difference]: Without dead ends: 200 [2022-07-23 05:56:00,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-07-23 05:56:00,433 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 56 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:00,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 481 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:56:00,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-23 05:56:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2022-07-23 05:56:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 140 states have (on average 1.6) internal successors, (224), 179 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2022-07-23 05:56:00,437 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 29 [2022-07-23 05:56:00,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:00,437 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2022-07-23 05:56:00,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2022-07-23 05:56:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 05:56:00,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:00,445 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] [2022-07-23 05:56:00,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 05:56:00,445 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:56:00,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:00,446 INFO L85 PathProgramCache]: Analyzing trace with hash 653860756, now seen corresponding path program 1 times [2022-07-23 05:56:00,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:00,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141684289] [2022-07-23 05:56:00,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:00,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:00,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 05:56:00,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:00,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141684289] [2022-07-23 05:56:00,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141684289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:00,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:56:00,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:56:00,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489902389] [2022-07-23 05:56:00,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:00,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:56:00,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:00,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:56:00,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:56:00,483 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:00,622 INFO L93 Difference]: Finished difference Result 251 states and 315 transitions. [2022-07-23 05:56:00,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:56:00,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-23 05:56:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:00,623 INFO L225 Difference]: With dead ends: 251 [2022-07-23 05:56:00,624 INFO L226 Difference]: Without dead ends: 251 [2022-07-23 05:56:00,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-23 05:56:00,624 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 77 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:00,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 230 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:56:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-23 05:56:00,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 184. [2022-07-23 05:56:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 146 states have (on average 1.6095890410958904) internal successors, (235), 183 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 235 transitions. [2022-07-23 05:56:00,629 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 235 transitions. Word has length 30 [2022-07-23 05:56:00,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:00,629 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 235 transitions. [2022-07-23 05:56:00,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:00,629 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 235 transitions. [2022-07-23 05:56:00,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 05:56:00,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:00,629 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:56:00,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 05:56:00,630 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:56:00,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:00,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1294968215, now seen corresponding path program 1 times [2022-07-23 05:56:00,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:00,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265473662] [2022-07-23 05:56:00,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:00,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:00,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:00,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265473662] [2022-07-23 05:56:00,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265473662] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:56:00,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090818695] [2022-07-23 05:56:00,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:00,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:00,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:56:00,963 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-23 05:56:00,966 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-23 05:56:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:01,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 05:56:01,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:56:01,151 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-23 05:56:01,155 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-23 05:56:01,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 05:56:01,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 05:56:01,297 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:56:01,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:56:01,322 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:56:01,322 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-23 05:56:01,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 05:56:01,419 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-23 05:56:01,420 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 36 [2022-07-23 05:56:01,696 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-23 05:56:02,016 INFO L356 Elim1Store]: treesize reduction 97, result has 41.2 percent of original size [2022-07-23 05:56:02,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 118 [2022-07-23 05:56:02,046 INFO L356 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-07-23 05:56:02,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 137 [2022-07-23 05:56:02,063 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-23 05:56:02,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 144 [2022-07-23 05:56:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:02,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:56:02,420 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 10 treesize of output 8 [2022-07-23 05:56:02,970 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-07-23 05:56:02,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 72 [2022-07-23 05:56:03,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2022-07-23 05:56:03,223 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (.cse6 (= (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|) 4))) (let ((.cse0 (not .cse6)) (.cse9 (not .cse7))) (and (or .cse0 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse1 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse2 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))))) (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse3) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse3)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse5 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse4 .cse5) 0) 0) (= (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse5))))) .cse6) (or .cse7 (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse8 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse8) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse8))))) (or .cse9 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse10 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse10 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_20) 0) 0)))) .cse6) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse12 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse11 .cse12) 0) 0) (= (select (select .cse11 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse12)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (or .cse0 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 4)) 0) 0))))))) (or .cse7 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_20) 0) 0)))) (or .cse9 (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0))))))) is different from false [2022-07-23 05:56:03,463 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_1 4))) (or (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) 0) 0) (not (= .cse0 |c_ULTIMATE.start_main_~item~0#1.base|))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse1 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse2 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) is different from false [2022-07-23 05:56:03,534 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int)) (or (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= 0 (select (select .cse0 v_arrayElimCell_20) 0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= 0 (select (select .cse1 v_arrayElimCell_20) 0))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_1 4))) (or (not (= .cse2 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse2) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) is different from false [2022-07-23 05:56:03,650 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-23 05:56:03,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-23 05:56:03,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:03,658 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 05:56:03,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2022-07-23 05:56:03,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:03,667 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-23 05:56:03,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 1 [2022-07-23 05:56:03,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:03,673 INFO L356 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-07-23 05:56:03,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2022-07-23 05:56:03,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:03,680 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-23 05:56:03,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2022-07-23 05:56:03,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:03,685 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-23 05:56:03,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 1 [2022-07-23 05:56:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:03,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090818695] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:56:03,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:56:03,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 41 [2022-07-23 05:56:03,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650040488] [2022-07-23 05:56:03,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:56:03,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-23 05:56:03,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:03,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-23 05:56:03,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1238, Unknown=23, NotChecked=222, Total=1640 [2022-07-23 05:56:03,693 INFO L87 Difference]: Start difference. First operand 184 states and 235 transitions. Second operand has 41 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:03,729 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int)) (or (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= 0 (select (select .cse0 v_arrayElimCell_20) 0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= 0 (select (select .cse1 v_arrayElimCell_20) 0))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_1 4))) (or (not (= .cse2 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse2) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) is different from false [2022-07-23 05:56:03,738 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_1 4))) (or (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) 0) 0) (not (= .cse0 |c_ULTIMATE.start_main_~item~0#1.base|))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse1 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse2 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) is different from false [2022-07-23 05:56:03,747 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (.cse9 (= (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|) 4))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse3 (not .cse9)) (.cse11 (not .cse1))) (and (= (select .cse0 0) 0) .cse1 (= 0 (select .cse2 0)) (or .cse3 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse4 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse5 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))))) (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse6 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse6) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse6)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse8 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse7 .cse8) 0) 0) (= (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse8))))) .cse9) (or .cse1 (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse10 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse10) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse10))))) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (or .cse11 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse12 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse12 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_20) 0) 0)))) .cse9) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse14 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse13 .cse14) 0) 0) (= (select (select .cse13 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse14)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (or (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (and (= (select .cse0 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select .cse2 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (or .cse3 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 4)) 0) 0))))))) (or .cse1 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_20) 0) 0)))) (or .cse11 (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0))))))) is different from false [2022-07-23 05:56:03,904 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (.cse0 (= |c_ULTIMATE.start_main_~item~0#1.offset| 0))) (and (or (= |c_ULTIMATE.start_main_~item~0#1.base| |c_ULTIMATE.start_main_~data~0#1.base|) (not .cse0) (and .cse1 .cse2)) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int)) (or (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= 0 (select (select .cse3 v_arrayElimCell_20) 0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) .cse1 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)))) (or (= .cse4 |c_ULTIMATE.start_main_~data~0#1.base|) (and (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse4) 0) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= 0 (select (select .cse5 v_arrayElimCell_20) 0))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0))) .cse2 .cse0 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_1 4))) (or (not (= .cse6 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse6) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))))) is different from false [2022-07-23 05:56:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:04,639 INFO L93 Difference]: Finished difference Result 209 states and 261 transitions. [2022-07-23 05:56:04,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 05:56:04,640 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-23 05:56:04,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:04,641 INFO L225 Difference]: With dead ends: 209 [2022-07-23 05:56:04,641 INFO L226 Difference]: Without dead ends: 209 [2022-07-23 05:56:04,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=284, Invalid=1971, Unknown=29, NotChecked=686, Total=2970 [2022-07-23 05:56:04,642 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 236 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 825 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:04,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1436 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 899 Invalid, 0 Unknown, 825 Unchecked, 0.5s Time] [2022-07-23 05:56:04,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-23 05:56:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 186. [2022-07-23 05:56:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 148 states have (on average 1.6013513513513513) internal successors, (237), 185 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 237 transitions. [2022-07-23 05:56:04,647 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 237 transitions. Word has length 32 [2022-07-23 05:56:04,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:04,647 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 237 transitions. [2022-07-23 05:56:04,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 237 transitions. [2022-07-23 05:56:04,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 05:56:04,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:04,650 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] [2022-07-23 05:56:04,679 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-23 05:56:04,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:04,863 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:56:04,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:04,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1489307653, now seen corresponding path program 1 times [2022-07-23 05:56:04,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:04,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559188245] [2022-07-23 05:56:04,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:04,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:05,167 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-23 05:56:05,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:05,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559188245] [2022-07-23 05:56:05,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559188245] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:56:05,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152944551] [2022-07-23 05:56:05,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:05,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:05,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:56:05,170 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-23 05:56:05,171 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-23 05:56:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:05,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-23 05:56:05,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:56:05,369 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-23 05:56:05,480 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:05,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36 [2022-07-23 05:56:05,852 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-23 05:56:05,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:56:06,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 96 [2022-07-23 05:56:12,813 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-23 05:56:12,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152944551] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:56:12,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:56:12,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 35 [2022-07-23 05:56:12,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936352177] [2022-07-23 05:56:12,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:56:12,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-23 05:56:12,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:12,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-23 05:56:12,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1124, Unknown=0, NotChecked=0, Total=1260 [2022-07-23 05:56:12,819 INFO L87 Difference]: Start difference. First operand 186 states and 237 transitions. Second operand has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 36 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:13,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:13,371 INFO L93 Difference]: Finished difference Result 188 states and 238 transitions. [2022-07-23 05:56:13,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 05:56:13,372 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 36 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-23 05:56:13,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:13,372 INFO L225 Difference]: With dead ends: 188 [2022-07-23 05:56:13,372 INFO L226 Difference]: Without dead ends: 171 [2022-07-23 05:56:13,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=182, Invalid=1540, Unknown=0, NotChecked=0, Total=1722 [2022-07-23 05:56:13,374 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 23 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 582 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:13,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 938 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 483 Invalid, 0 Unknown, 582 Unchecked, 0.3s Time] [2022-07-23 05:56:13,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-23 05:56:13,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-23 05:56:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 170 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 221 transitions. [2022-07-23 05:56:13,377 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 221 transitions. Word has length 33 [2022-07-23 05:56:13,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:13,377 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 221 transitions. [2022-07-23 05:56:13,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 36 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:13,378 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 221 transitions. [2022-07-23 05:56:13,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 05:56:13,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:13,379 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-23 05:56:13,401 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-23 05:56:13,579 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,SelfDestructingSolverStorable19 [2022-07-23 05:56:13,580 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:56:13,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:13,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1756679628, now seen corresponding path program 1 times [2022-07-23 05:56:13,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:13,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813403770] [2022-07-23 05:56:13,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:13,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:13,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:13,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813403770] [2022-07-23 05:56:13,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813403770] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:56:13,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571024894] [2022-07-23 05:56:13,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:13,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:13,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:56:13,716 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-23 05:56:13,720 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-23 05:56:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:13,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-23 05:56:13,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:56:13,914 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-23 05:56:13,921 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-23 05:56:13,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:13,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2022-07-23 05:56:13,962 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-23 05:56:13,963 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 48 treesize of output 38 [2022-07-23 05:56:14,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-23 05:56:14,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-23 05:56:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:14,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:56:14,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571024894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:14,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 05:56:14,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 17 [2022-07-23 05:56:14,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371996394] [2022-07-23 05:56:14,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:14,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 05:56:14,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:14,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 05:56:14,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-07-23 05:56:14,135 INFO L87 Difference]: Start difference. First operand 171 states and 221 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:14,457 INFO L93 Difference]: Finished difference Result 210 states and 237 transitions. [2022-07-23 05:56:14,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 05:56:14,458 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-23 05:56:14,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:14,459 INFO L225 Difference]: With dead ends: 210 [2022-07-23 05:56:14,459 INFO L226 Difference]: Without dead ends: 210 [2022-07-23 05:56:14,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2022-07-23 05:56:14,460 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 269 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:14,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 479 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:56:14,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-23 05:56:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 171. [2022-07-23 05:56:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 170 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 220 transitions. [2022-07-23 05:56:14,464 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 220 transitions. Word has length 37 [2022-07-23 05:56:14,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:14,464 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 220 transitions. [2022-07-23 05:56:14,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 220 transitions. [2022-07-23 05:56:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 05:56:14,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:14,465 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-23 05:56:14,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-23 05:56:14,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:14,680 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:56:14,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:14,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1756679629, now seen corresponding path program 1 times [2022-07-23 05:56:14,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:14,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920489322] [2022-07-23 05:56:14,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:14,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:14,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:14,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920489322] [2022-07-23 05:56:14,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920489322] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:56:14,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786128840] [2022-07-23 05:56:14,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:14,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:14,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:56:14,785 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-23 05:56:14,786 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-23 05:56:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:14,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-23 05:56:14,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:56:14,926 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-23 05:56:14,979 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-23 05:56:14,986 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-23 05:56:15,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:15,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2022-07-23 05:56:15,031 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-23 05:56:15,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2022-07-23 05:56:15,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:56:15,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-23 05:56:15,169 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:15,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:56:15,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786128840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:15,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 05:56:15,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2022-07-23 05:56:15,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829472415] [2022-07-23 05:56:15,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:15,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 05:56:15,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:15,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 05:56:15,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-07-23 05:56:15,172 INFO L87 Difference]: Start difference. First operand 171 states and 220 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:15,457 INFO L93 Difference]: Finished difference Result 196 states and 223 transitions. [2022-07-23 05:56:15,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 05:56:15,460 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-23 05:56:15,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:15,460 INFO L225 Difference]: With dead ends: 196 [2022-07-23 05:56:15,460 INFO L226 Difference]: Without dead ends: 196 [2022-07-23 05:56:15,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2022-07-23 05:56:15,461 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 268 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:15,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 424 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:56:15,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-23 05:56:15,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 171. [2022-07-23 05:56:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 170 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 219 transitions. [2022-07-23 05:56:15,465 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 219 transitions. Word has length 37 [2022-07-23 05:56:15,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:15,465 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 219 transitions. [2022-07-23 05:56:15,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:15,466 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 219 transitions. [2022-07-23 05:56:15,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 05:56:15,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:15,466 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:56:15,487 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-23 05:56:15,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:15,680 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:56:15,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:15,680 INFO L85 PathProgramCache]: Analyzing trace with hash 507133380, now seen corresponding path program 1 times [2022-07-23 05:56:15,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:15,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707444839] [2022-07-23 05:56:15,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:15,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:15,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:15,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707444839] [2022-07-23 05:56:15,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707444839] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:56:15,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257071083] [2022-07-23 05:56:15,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:15,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:15,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:56:15,792 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-23 05:56:15,817 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-23 05:56:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:15,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-23 05:56:15,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:56:15,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:56:15,950 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 05:56:15,951 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-23 05:56:15,964 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:56:15,965 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-23 05:56:15,975 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-23 05:56:15,985 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:56:15,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-23 05:56:15,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-23 05:56:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:15,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:56:16,007 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_887) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.base|))) is different from false [2022-07-23 05:56:16,012 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:16,013 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 19 treesize of output 20 [2022-07-23 05:56:16,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2022-07-23 05:56:16,018 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 6 treesize of output 4 [2022-07-23 05:56:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-23 05:56:16,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257071083] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:56:16,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:56:16,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-07-23 05:56:16,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076985960] [2022-07-23 05:56:16,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:56:16,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 05:56:16,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:16,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 05:56:16,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2022-07-23 05:56:16,072 INFO L87 Difference]: Start difference. First operand 171 states and 219 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:16,321 INFO L93 Difference]: Finished difference Result 171 states and 216 transitions. [2022-07-23 05:56:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 05:56:16,322 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-23 05:56:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:16,322 INFO L225 Difference]: With dead ends: 171 [2022-07-23 05:56:16,322 INFO L226 Difference]: Without dead ends: 171 [2022-07-23 05:56:16,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=251, Unknown=1, NotChecked=34, Total=380 [2022-07-23 05:56:16,323 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 89 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:16,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 496 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 356 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2022-07-23 05:56:16,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-23 05:56:16,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2022-07-23 05:56:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 129 states have (on average 1.6589147286821706) internal successors, (214), 166 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 214 transitions. [2022-07-23 05:56:16,327 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 214 transitions. Word has length 40 [2022-07-23 05:56:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:16,327 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 214 transitions. [2022-07-23 05:56:16,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 214 transitions. [2022-07-23 05:56:16,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 05:56:16,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:16,328 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:56:16,353 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-23 05:56:16,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-23 05:56:16,544 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:56:16,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:16,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1119299147, now seen corresponding path program 1 times [2022-07-23 05:56:16,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:16,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829668414] [2022-07-23 05:56:16,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:16,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-23 05:56:16,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:16,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829668414] [2022-07-23 05:56:16,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829668414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:16,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:56:16,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:56:16,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621300085] [2022-07-23 05:56:16,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:16,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:56:16,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:16,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:56:16,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:56:16,597 INFO L87 Difference]: Start difference. First operand 167 states and 214 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:16,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:16,744 INFO L93 Difference]: Finished difference Result 166 states and 212 transitions. [2022-07-23 05:56:16,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 05:56:16,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-23 05:56:16,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:16,745 INFO L225 Difference]: With dead ends: 166 [2022-07-23 05:56:16,745 INFO L226 Difference]: Without dead ends: 166 [2022-07-23 05:56:16,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:56:16,746 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 25 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:16,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 305 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:56:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-23 05:56:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-07-23 05:56:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 165 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 212 transitions. [2022-07-23 05:56:16,749 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 212 transitions. Word has length 41 [2022-07-23 05:56:16,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:16,749 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 212 transitions. [2022-07-23 05:56:16,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 212 transitions. [2022-07-23 05:56:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 05:56:16,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:16,750 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:56:16,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-23 05:56:16,750 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:56:16,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:16,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1119299146, now seen corresponding path program 1 times [2022-07-23 05:56:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:16,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971643218] [2022-07-23 05:56:16,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:16,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:16,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:16,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971643218] [2022-07-23 05:56:16,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971643218] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:56:16,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467088855] [2022-07-23 05:56:16,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:16,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:16,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:56:16,889 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-23 05:56:16,889 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-23 05:56:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:17,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-23 05:56:17,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:56:17,094 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-23 05:56:17,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:17,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 05:56:17,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-23 05:56:17,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-23 05:56:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:17,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:56:17,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467088855] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:56:17,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 05:56:17,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2022-07-23 05:56:17,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143029969] [2022-07-23 05:56:17,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:56:17,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 05:56:17,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:17,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 05:56:17,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2022-07-23 05:56:17,304 INFO L87 Difference]: Start difference. First operand 166 states and 212 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:17,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:17,632 INFO L93 Difference]: Finished difference Result 226 states and 253 transitions. [2022-07-23 05:56:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 05:56:17,633 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-23 05:56:17,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:17,634 INFO L225 Difference]: With dead ends: 226 [2022-07-23 05:56:17,634 INFO L226 Difference]: Without dead ends: 226 [2022-07-23 05:56:17,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2022-07-23 05:56:17,634 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 375 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:17,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 391 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:56:17,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-23 05:56:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 166. [2022-07-23 05:56:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.627906976744186) internal successors, (210), 165 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2022-07-23 05:56:17,638 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 41 [2022-07-23 05:56:17,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:17,638 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2022-07-23 05:56:17,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2022-07-23 05:56:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 05:56:17,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:17,639 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:56:17,660 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-23 05:56:17,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:17,852 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:56:17,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:17,852 INFO L85 PathProgramCache]: Analyzing trace with hash -716785192, now seen corresponding path program 1 times [2022-07-23 05:56:17,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:17,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640952108] [2022-07-23 05:56:17,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:17,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:17,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:17,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640952108] [2022-07-23 05:56:17,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640952108] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:56:17,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465339207] [2022-07-23 05:56:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:17,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:17,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:56:17,971 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-23 05:56:17,997 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-23 05:56:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:18,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 05:56:18,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:56:18,180 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-23 05:56:18,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:18,211 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-23 05:56:18,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:56:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:18,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:56:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:18,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465339207] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:56:18,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:56:18,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-07-23 05:56:18,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557428104] [2022-07-23 05:56:18,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:56:18,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 05:56:18,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:56:18,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 05:56:18,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-07-23 05:56:18,417 INFO L87 Difference]: Start difference. First operand 166 states and 210 transitions. Second operand has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:18,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:56:18,954 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2022-07-23 05:56:18,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-23 05:56:18,954 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-23 05:56:18,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:56:18,955 INFO L225 Difference]: With dead ends: 186 [2022-07-23 05:56:18,955 INFO L226 Difference]: Without dead ends: 186 [2022-07-23 05:56:18,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=373, Invalid=1267, Unknown=0, NotChecked=0, Total=1640 [2022-07-23 05:56:18,956 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 474 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:56:18,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 659 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 490 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2022-07-23 05:56:18,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-23 05:56:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 166. [2022-07-23 05:56:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.62015503875969) internal successors, (209), 165 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 209 transitions. [2022-07-23 05:56:18,959 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 209 transitions. Word has length 45 [2022-07-23 05:56:18,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:56:18,959 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 209 transitions. [2022-07-23 05:56:18,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:56:18,959 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 209 transitions. [2022-07-23 05:56:18,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-23 05:56:18,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:56:18,960 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:56:18,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-23 05:56:19,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:19,168 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:56:19,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:56:19,168 INFO L85 PathProgramCache]: Analyzing trace with hash 829868235, now seen corresponding path program 1 times [2022-07-23 05:56:19,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:56:19,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651174533] [2022-07-23 05:56:19,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:19,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:56:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:19,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:56:19,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651174533] [2022-07-23 05:56:19,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651174533] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:56:19,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446344890] [2022-07-23 05:56:19,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:56:19,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:56:19,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:56:19,515 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-23 05:56:19,516 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-23 05:56:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:56:19,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-23 05:56:19,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:56:19,652 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-23 05:56:19,669 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:56:19,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:56:19,730 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-23 05:56:19,793 INFO L356 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-07-23 05:56:19,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2022-07-23 05:56:19,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-23 05:56:19,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-23 05:56:19,961 INFO L356 Elim1Store]: treesize reduction 78, result has 31.6 percent of original size [2022-07-23 05:56:19,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 31 treesize of output 53 [2022-07-23 05:56:20,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 05:56:20,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:20,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-07-23 05:56:20,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:20,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:20,241 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-23 05:56:20,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 48 [2022-07-23 05:56:20,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:20,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:56:20,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 28 [2022-07-23 05:56:20,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-23 05:56:20,859 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:56:20,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2022-07-23 05:56:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:56:20,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:56:21,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-07-23 05:56:21,552 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1369 Int) (v_ArrVal_1368 Int)) (= (let ((.cse5 (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1364))) (store .cse7 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))))) (store .cse6 |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~lItem~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|) v_ArrVal_1368))) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse5 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1369) (select .cse5 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)))) 1)))) (and (or .cse0 (<= |c_ULTIMATE.start_main_~data~0#1.offset| 0)) (or .cse0 (<= 0 |c_ULTIMATE.start_main_~data~0#1.offset|)) (forall ((v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1369 Int) (v_ArrVal_1368 Int)) (let ((.cse2 (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1364))) (store .cse4 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))))) (store .cse3 |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~lItem~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|) v_ArrVal_1368))) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (= (select (store |c_#valid| .cse1 v_ArrVal_1369) (select .cse2 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) 1) (= .cse1 |c_ULTIMATE.start_main_~data~0#1.base|))))))) is different from false [2022-07-23 05:56:22,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:22,619 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 302 treesize of output 192 [2022-07-23 05:56:22,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:22,646 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:22,646 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 593 treesize of output 591 [2022-07-23 05:56:22,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:22,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:22,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1003 treesize of output 923 [2022-07-23 05:56:22,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:22,676 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 490 treesize of output 474 [2022-07-23 05:56:22,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-23 05:56:22,715 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:22,726 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:22,726 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 504 treesize of output 496 [2022-07-23 05:56:53,436 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:53,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 135 [2022-07-23 05:56:53,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:53,454 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:53,454 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 552 treesize of output 550 [2022-07-23 05:56:53,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:53,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:53,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 940 treesize of output 860 [2022-07-23 05:56:53,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:53,483 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 486 treesize of output 470 [2022-07-23 05:56:53,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 8 treesize of output 4 [2022-07-23 05:56:53,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:56:53,525 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:56:53,525 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 500 treesize of output 492 [2022-07-23 05:58:58,896 WARN L233 SmtUtils]: Spent 1.81m on a formula simplification. DAG size of input: 1690 DAG size of output: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 05:58:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:58:59,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446344890] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:58:59,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:58:59,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 21] total 50 [2022-07-23 05:58:59,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950109958] [2022-07-23 05:58:59,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:58:59,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-23 05:58:59,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:58:59,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-23 05:58:59,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=2158, Unknown=4, NotChecked=96, Total=2550 [2022-07-23 05:58:59,965 INFO L87 Difference]: Start difference. First operand 166 states and 209 transitions. Second operand has 51 states, 50 states have (on average 2.72) internal successors, (136), 51 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:59:00,665 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-07-23 05:59:00,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 05:59:00,665 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.72) internal successors, (136), 51 states have internal predecessors, (136), 0 states have call successors, (0), 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 48 [2022-07-23 05:59:00,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:59:00,666 INFO L225 Difference]: With dead ends: 166 [2022-07-23 05:59:00,667 INFO L226 Difference]: Without dead ends: 166 [2022-07-23 05:59:00,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 118.0s TimeCoverageRelationStatistics Valid=434, Invalid=2988, Unknown=4, NotChecked=114, Total=3540 [2022-07-23 05:59:00,668 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 38 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 722 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:59:00,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 935 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 152 Invalid, 0 Unknown, 722 Unchecked, 0.1s Time] [2022-07-23 05:59:00,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-23 05:59:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2022-07-23 05:59:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 127 states have (on average 1.6062992125984252) internal successors, (204), 163 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2022-07-23 05:59:00,672 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 48 [2022-07-23 05:59:00,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:59:00,672 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2022-07-23 05:59:00,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.72) internal successors, (136), 51 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:59:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2022-07-23 05:59:00,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-23 05:59:00,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:59:00,674 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:59:00,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-23 05:59:00,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-23 05:59:00,886 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-23 05:59:00,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:59:00,886 INFO L85 PathProgramCache]: Analyzing trace with hash 829868236, now seen corresponding path program 1 times [2022-07-23 05:59:00,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:59:00,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516834659] [2022-07-23 05:59:00,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:59:00,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:59:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:59:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:59:01,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:59:01,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516834659] [2022-07-23 05:59:01,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516834659] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:59:01,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105963934] [2022-07-23 05:59:01,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:59:01,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:59:01,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:59:01,333 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:59:01,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-23 05:59:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:59:01,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-23 05:59:01,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:59:01,481 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-23 05:59:01,486 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-23 05:59:01,538 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 05:59:01,539 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-23 05:59:01,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:59:01,637 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-23 05:59:01,646 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-23 05:59:01,708 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-23 05:59:01,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-23 05:59:01,730 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-23 05:59:01,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-23 05:59:01,782 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-23 05:59:01,787 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 32 treesize of output 30 [2022-07-23 05:59:01,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:59:01,817 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 32 treesize of output 30 [2022-07-23 05:59:01,861 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-23 05:59:01,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-23 05:59:01,986 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:59:01,987 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 32 treesize of output 34 [2022-07-23 05:59:01,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-07-23 05:59:02,019 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:59:02,020 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-23 05:59:02,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:59:02,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 05:59:02,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:59:02,131 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 52 treesize of output 43 [2022-07-23 05:59:02,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:59:02,228 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-23 05:59:02,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 74 [2022-07-23 05:59:02,250 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 05:59:02,250 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 36 [2022-07-23 05:59:02,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:59:02,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:59:02,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 59 [2022-07-23 05:59:03,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:59:03,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:59:03,480 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:03,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 61 [2022-07-23 05:59:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:59:03,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:59:09,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:09,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 123 [2022-07-23 05:59:09,499 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:09,500 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 319 treesize of output 229 [2022-07-23 05:59:09,536 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:09,537 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 1580 treesize of output 1582 [2022-07-23 05:59:09,581 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:59:09,582 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 12874 treesize of output 12871 [2022-07-23 05:59:09,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:59:09,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13108 treesize of output 12484 [2022-07-23 05:59:09,807 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 14614 treesize of output 14358 [2022-07-23 05:59:09,886 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 254 treesize of output 238 [2022-07-23 05:59:09,947 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 123 treesize of output 115 [2022-07-23 05:59:10,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-23 05:59:10,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14594 treesize of output 14590