./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 7e1ff0e6 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-?-7e1ff0e [2023-02-15 01:06:12,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:06:12,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:06:12,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:06:12,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:06:12,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:06:12,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:06:12,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:06:12,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:06:12,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:06:12,150 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:06:12,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:06:12,151 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:06:12,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:06:12,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:06:12,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:06:12,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:06:12,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:06:12,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:06:12,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:06:12,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:06:12,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:06:12,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:06:12,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:06:12,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:06:12,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:06:12,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:06:12,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:06:12,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:06:12,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:06:12,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:06:12,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:06:12,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:06:12,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:06:12,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:06:12,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:06:12,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:06:12,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:06:12,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:06:12,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:06:12,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:06:12,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:06:12,202 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:06:12,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:06:12,203 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:06:12,203 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:06:12,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:06:12,204 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:06:12,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:06:12,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:06:12,205 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:06:12,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:06:12,206 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:06:12,206 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:06:12,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:06:12,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:06:12,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:06:12,207 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:06:12,207 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:06:12,207 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:06:12,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:06:12,207 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:06:12,207 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:06:12,207 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:06:12,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:06:12,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:06:12,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:06:12,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:06:12,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:06:12,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:06:12,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:06:12,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:06:12,209 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:06:12,209 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:06:12,209 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:06:12,209 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:06:12,210 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e [2023-02-15 01:06:12,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:06:12,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:06:12,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:06:12,418 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:06:12,418 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:06:12,419 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0513.i [2023-02-15 01:06:13,392 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:06:13,651 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:06:13,651 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0513.i [2023-02-15 01:06:13,662 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20490b787/7632f9f88870437491f403807c8baf43/FLAG279837e1c [2023-02-15 01:06:13,677 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20490b787/7632f9f88870437491f403807c8baf43 [2023-02-15 01:06:13,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:06:13,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:06:13,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:06:13,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:06:13,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:06:13,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:06:13" (1/1) ... [2023-02-15 01:06:13,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b771626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:06:13, skipping insertion in model container [2023-02-15 01:06:13,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:06:13" (1/1) ... [2023-02-15 01:06:13,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:06:13,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:06:13,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:06:13,960 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:06:14,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:06:14,029 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:06:14,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:06:14 WrapperNode [2023-02-15 01:06:14,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:06:14,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:06:14,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:06:14,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:06:14,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:06:14" (1/1) ... [2023-02-15 01:06:14,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:06:14" (1/1) ... [2023-02-15 01:06:14,076 INFO L138 Inliner]: procedures = 123, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2023-02-15 01:06:14,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:06:14,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:06:14,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:06:14,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:06:14,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:06:14" (1/1) ... [2023-02-15 01:06:14,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:06:14" (1/1) ... [2023-02-15 01:06:14,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:06:14" (1/1) ... [2023-02-15 01:06:14,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:06:14" (1/1) ... [2023-02-15 01:06:14,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:06:14" (1/1) ... [2023-02-15 01:06:14,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:06:14" (1/1) ... [2023-02-15 01:06:14,131 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:06:14" (1/1) ... [2023-02-15 01:06:14,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:06:14" (1/1) ... [2023-02-15 01:06:14,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:06:14,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:06:14,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:06:14,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:06:14,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:06:14" (1/1) ... [2023-02-15 01:06:14,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:06:14,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:06:14,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 01:06:14,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 01:06:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 01:06:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 01:06:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:06:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:06:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 01:06:14,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 01:06:14,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:06:14,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:06:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:06:14,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:06:14,303 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:06:14,304 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:06:14,563 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:06:14,567 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:06:14,567 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 01:06:14,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:06:14 BoogieIcfgContainer [2023-02-15 01:06:14,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:06:14,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:06:14,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:06:14,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:06:14,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:06:13" (1/3) ... [2023-02-15 01:06:14,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ad0a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:06:14, skipping insertion in model container [2023-02-15 01:06:14,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:06:14" (2/3) ... [2023-02-15 01:06:14,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ad0a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:06:14, skipping insertion in model container [2023-02-15 01:06:14,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:06:14" (3/3) ... [2023-02-15 01:06:14,573 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0513.i [2023-02-15 01:06:14,588 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:06:14,588 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-02-15 01:06:14,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:06:14,631 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e2cc605, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:06:14,631 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2023-02-15 01:06:14,634 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) [2023-02-15 01:06:14,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 01:06:14,637 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:14,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 01:06:14,638 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)] === [2023-02-15 01:06:14,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:14,643 INFO L85 PathProgramCache]: Analyzing trace with hash 28740643, now seen corresponding path program 1 times [2023-02-15 01:06:14,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:14,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109748710] [2023-02-15 01:06:14,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:14,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:14,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:14,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109748710] [2023-02-15 01:06:14,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109748710] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:14,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:14,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:06:14,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173885910] [2023-02-15 01:06:14,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:14,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 01:06:14,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:14,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 01:06:14,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:06:14,771 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) [2023-02-15 01:06:14,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:14,795 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2023-02-15 01:06:14,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 01:06:14,797 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 [2023-02-15 01:06:14,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:14,810 INFO L225 Difference]: With dead ends: 132 [2023-02-15 01:06:14,811 INFO L226 Difference]: Without dead ends: 130 [2023-02-15 01:06:14,812 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 [2023-02-15 01:06:14,816 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 [2023-02-15 01:06:14,817 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] [2023-02-15 01:06:14,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-15 01:06:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2023-02-15 01:06:14,848 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) [2023-02-15 01:06:14,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2023-02-15 01:06:14,859 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 5 [2023-02-15 01:06:14,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:14,860 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2023-02-15 01:06:14,861 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) [2023-02-15 01:06:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2023-02-15 01:06:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:06:14,862 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:14,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:06:14,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:06:14,862 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)] === [2023-02-15 01:06:14,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:14,863 INFO L85 PathProgramCache]: Analyzing trace with hash 889570808, now seen corresponding path program 1 times [2023-02-15 01:06:14,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:14,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165176974] [2023-02-15 01:06:14,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:14,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:14,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:14,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165176974] [2023-02-15 01:06:14,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165176974] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:14,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:14,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:06:14,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428592578] [2023-02-15 01:06:14,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:14,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:06:14,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:14,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:06:14,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:06:14,922 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) [2023-02-15 01:06:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:15,051 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2023-02-15 01:06:15,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:06:15,051 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 [2023-02-15 01:06:15,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:15,052 INFO L225 Difference]: With dead ends: 176 [2023-02-15 01:06:15,053 INFO L226 Difference]: Without dead ends: 175 [2023-02-15 01:06:15,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:06:15,054 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 [2023-02-15 01:06:15,055 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] [2023-02-15 01:06:15,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-15 01:06:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 133. [2023-02-15 01:06:15,062 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) [2023-02-15 01:06:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2023-02-15 01:06:15,063 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 6 [2023-02-15 01:06:15,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:15,064 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2023-02-15 01:06:15,065 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) [2023-02-15 01:06:15,065 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2023-02-15 01:06:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:06:15,065 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:15,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:06:15,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:06:15,066 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)] === [2023-02-15 01:06:15,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:15,069 INFO L85 PathProgramCache]: Analyzing trace with hash 889570732, now seen corresponding path program 1 times [2023-02-15 01:06:15,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:15,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632835620] [2023-02-15 01:06:15,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:15,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:15,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:15,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:15,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632835620] [2023-02-15 01:06:15,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632835620] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:15,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:15,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:06:15,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405132667] [2023-02-15 01:06:15,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:15,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:06:15,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:15,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:06:15,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:06:15,111 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) [2023-02-15 01:06:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:15,170 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2023-02-15 01:06:15,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:06:15,171 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 [2023-02-15 01:06:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:15,172 INFO L225 Difference]: With dead ends: 145 [2023-02-15 01:06:15,172 INFO L226 Difference]: Without dead ends: 144 [2023-02-15 01:06:15,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:06:15,180 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:15,180 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.1s Time] [2023-02-15 01:06:15,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-15 01:06:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2023-02-15 01:06:15,187 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) [2023-02-15 01:06:15,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2023-02-15 01:06:15,187 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 6 [2023-02-15 01:06:15,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:15,188 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2023-02-15 01:06:15,188 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) [2023-02-15 01:06:15,188 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2023-02-15 01:06:15,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:06:15,188 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:15,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:06:15,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:06:15,189 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)] === [2023-02-15 01:06:15,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:15,189 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2023-02-15 01:06:15,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:15,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110897107] [2023-02-15 01:06:15,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:15,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:15,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:15,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110897107] [2023-02-15 01:06:15,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110897107] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:15,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:15,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:06:15,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938141941] [2023-02-15 01:06:15,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:15,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:06:15,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:15,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:06:15,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:06:15,259 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) [2023-02-15 01:06:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:15,366 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2023-02-15 01:06:15,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:06:15,366 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 [2023-02-15 01:06:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:15,368 INFO L225 Difference]: With dead ends: 169 [2023-02-15 01:06:15,368 INFO L226 Difference]: Without dead ends: 169 [2023-02-15 01:06:15,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:06:15,369 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 [2023-02-15 01:06:15,370 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] [2023-02-15 01:06:15,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-15 01:06:15,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 139. [2023-02-15 01:06:15,374 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) [2023-02-15 01:06:15,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2023-02-15 01:06:15,375 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 6 [2023-02-15 01:06:15,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:15,375 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2023-02-15 01:06:15,375 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) [2023-02-15 01:06:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2023-02-15 01:06:15,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:06:15,376 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:15,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:06:15,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:06:15,376 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)] === [2023-02-15 01:06:15,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2023-02-15 01:06:15,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:15,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194789173] [2023-02-15 01:06:15,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:15,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:15,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:15,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194789173] [2023-02-15 01:06:15,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194789173] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:15,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:15,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:06:15,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048664181] [2023-02-15 01:06:15,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:15,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:06:15,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:15,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:06:15,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:06:15,429 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) [2023-02-15 01:06:15,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:15,504 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2023-02-15 01:06:15,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:06:15,504 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 [2023-02-15 01:06:15,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:15,505 INFO L225 Difference]: With dead ends: 137 [2023-02-15 01:06:15,505 INFO L226 Difference]: Without dead ends: 137 [2023-02-15 01:06:15,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:06:15,506 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 [2023-02-15 01:06:15,506 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] [2023-02-15 01:06:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-15 01:06:15,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2023-02-15 01:06:15,509 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) [2023-02-15 01:06:15,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2023-02-15 01:06:15,510 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 6 [2023-02-15 01:06:15,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:15,510 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2023-02-15 01:06:15,510 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) [2023-02-15 01:06:15,511 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2023-02-15 01:06:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 01:06:15,511 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:15,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:06:15,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:06:15,511 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)] === [2023-02-15 01:06:15,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:15,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2119659887, now seen corresponding path program 1 times [2023-02-15 01:06:15,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:15,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142801125] [2023-02-15 01:06:15,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:15,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:15,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142801125] [2023-02-15 01:06:15,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142801125] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:15,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:15,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:06:15,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488145693] [2023-02-15 01:06:15,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:15,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:06:15,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:15,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:06:15,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:06:15,561 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) [2023-02-15 01:06:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:15,616 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2023-02-15 01:06:15,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:06:15,617 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 [2023-02-15 01:06:15,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:15,618 INFO L225 Difference]: With dead ends: 133 [2023-02-15 01:06:15,618 INFO L226 Difference]: Without dead ends: 133 [2023-02-15 01:06:15,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:06:15,619 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 23 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 [2023-02-15 01:06:15,619 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] [2023-02-15 01:06:15,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-15 01:06:15,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-02-15 01:06:15,622 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) [2023-02-15 01:06:15,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2023-02-15 01:06:15,622 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2023-02-15 01:06:15,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:15,622 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2023-02-15 01:06:15,623 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) [2023-02-15 01:06:15,623 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2023-02-15 01:06:15,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 01:06:15,623 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:15,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:06:15,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 01:06:15,623 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)] === [2023-02-15 01:06:15,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:15,624 INFO L85 PathProgramCache]: Analyzing trace with hash -2119659886, now seen corresponding path program 1 times [2023-02-15 01:06:15,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:15,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792517834] [2023-02-15 01:06:15,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:15,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:15,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:15,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792517834] [2023-02-15 01:06:15,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792517834] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:15,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:15,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:06:15,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644314339] [2023-02-15 01:06:15,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:15,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:06:15,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:15,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:06:15,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:06:15,696 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) [2023-02-15 01:06:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:15,758 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2023-02-15 01:06:15,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:06:15,759 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 [2023-02-15 01:06:15,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:15,759 INFO L225 Difference]: With dead ends: 130 [2023-02-15 01:06:15,759 INFO L226 Difference]: Without dead ends: 130 [2023-02-15 01:06:15,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:06:15,760 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 [2023-02-15 01:06:15,760 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] [2023-02-15 01:06:15,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-15 01:06:15,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2023-02-15 01:06:15,763 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) [2023-02-15 01:06:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2023-02-15 01:06:15,764 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 11 [2023-02-15 01:06:15,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:15,764 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2023-02-15 01:06:15,764 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) [2023-02-15 01:06:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2023-02-15 01:06:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 01:06:15,765 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:15,765 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:06:15,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 01:06:15,765 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)] === [2023-02-15 01:06:15,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash -967503371, now seen corresponding path program 1 times [2023-02-15 01:06:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:15,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413930035] [2023-02-15 01:06:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:15,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:15,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:15,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413930035] [2023-02-15 01:06:15,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413930035] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:15,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:15,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:06:15,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296747719] [2023-02-15 01:06:15,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:15,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:06:15,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:15,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:06:15,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:06:15,847 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) [2023-02-15 01:06:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:15,931 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2023-02-15 01:06:15,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:06:15,932 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 [2023-02-15 01:06:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:15,933 INFO L225 Difference]: With dead ends: 228 [2023-02-15 01:06:15,933 INFO L226 Difference]: Without dead ends: 228 [2023-02-15 01:06:15,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:06:15,934 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 [2023-02-15 01:06:15,934 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] [2023-02-15 01:06:15,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-02-15 01:06:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 130. [2023-02-15 01:06:15,940 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) [2023-02-15 01:06:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2023-02-15 01:06:15,951 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 18 [2023-02-15 01:06:15,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:15,951 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2023-02-15 01:06:15,951 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) [2023-02-15 01:06:15,951 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2023-02-15 01:06:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 01:06:15,951 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:15,952 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:06:15,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 01:06:15,952 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)] === [2023-02-15 01:06:15,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:15,952 INFO L85 PathProgramCache]: Analyzing trace with hash -967503447, now seen corresponding path program 1 times [2023-02-15 01:06:15,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:15,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717832854] [2023-02-15 01:06:15,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:15,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:16,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:16,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717832854] [2023-02-15 01:06:16,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717832854] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:16,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:16,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:06:16,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154501703] [2023-02-15 01:06:16,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:16,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:06:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:06:16,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:06:16,033 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) [2023-02-15 01:06:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:16,177 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2023-02-15 01:06:16,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:06:16,177 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 [2023-02-15 01:06:16,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:16,178 INFO L225 Difference]: With dead ends: 124 [2023-02-15 01:06:16,178 INFO L226 Difference]: Without dead ends: 124 [2023-02-15 01:06:16,178 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 [2023-02-15 01:06:16,179 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 45 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:16,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 213 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:06:16,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-15 01:06:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2023-02-15 01:06:16,181 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) [2023-02-15 01:06:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2023-02-15 01:06:16,181 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 18 [2023-02-15 01:06:16,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:16,181 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2023-02-15 01:06:16,181 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) [2023-02-15 01:06:16,181 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2023-02-15 01:06:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 01:06:16,182 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:16,182 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:06:16,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 01:06:16,182 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)] === [2023-02-15 01:06:16,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:16,182 INFO L85 PathProgramCache]: Analyzing trace with hash -967503446, now seen corresponding path program 1 times [2023-02-15 01:06:16,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:16,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041306844] [2023-02-15 01:06:16,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:16,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:16,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:16,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041306844] [2023-02-15 01:06:16,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041306844] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:16,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:16,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:06:16,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064158352] [2023-02-15 01:06:16,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:16,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:06:16,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:16,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:06:16,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:06:16,288 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) [2023-02-15 01:06:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:16,422 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2023-02-15 01:06:16,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:06:16,423 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 [2023-02-15 01:06:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:16,423 INFO L225 Difference]: With dead ends: 204 [2023-02-15 01:06:16,423 INFO L226 Difference]: Without dead ends: 204 [2023-02-15 01:06:16,424 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 [2023-02-15 01:06:16,424 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 [2023-02-15 01:06:16,424 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] [2023-02-15 01:06:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-15 01:06:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 162. [2023-02-15 01:06:16,427 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) [2023-02-15 01:06:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 205 transitions. [2023-02-15 01:06:16,427 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 205 transitions. Word has length 18 [2023-02-15 01:06:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:16,427 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 205 transitions. [2023-02-15 01:06:16,427 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) [2023-02-15 01:06:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 205 transitions. [2023-02-15 01:06:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 01:06:16,428 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:16,428 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] [2023-02-15 01:06:16,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 01:06:16,429 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)] === [2023-02-15 01:06:16,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:16,429 INFO L85 PathProgramCache]: Analyzing trace with hash 199814016, now seen corresponding path program 1 times [2023-02-15 01:06:16,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:16,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242950930] [2023-02-15 01:06:16,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:16,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:16,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:16,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242950930] [2023-02-15 01:06:16,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242950930] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:16,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:16,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:06:16,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780094499] [2023-02-15 01:06:16,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:16,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:06:16,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:16,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:06:16,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:06:16,497 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) [2023-02-15 01:06:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:16,590 INFO L93 Difference]: Finished difference Result 205 states and 224 transitions. [2023-02-15 01:06:16,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:06:16,590 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 [2023-02-15 01:06:16,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:16,591 INFO L225 Difference]: With dead ends: 205 [2023-02-15 01:06:16,591 INFO L226 Difference]: Without dead ends: 205 [2023-02-15 01:06:16,591 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 [2023-02-15 01:06:16,592 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 224 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:16,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 309 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:06:16,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-02-15 01:06:16,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 163. [2023-02-15 01:06:16,595 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) [2023-02-15 01:06:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 206 transitions. [2023-02-15 01:06:16,595 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 206 transitions. Word has length 23 [2023-02-15 01:06:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:16,595 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 206 transitions. [2023-02-15 01:06:16,596 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) [2023-02-15 01:06:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2023-02-15 01:06:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 01:06:16,596 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:16,596 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] [2023-02-15 01:06:16,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 01:06:16,597 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)] === [2023-02-15 01:06:16,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:16,597 INFO L85 PathProgramCache]: Analyzing trace with hash 198674982, now seen corresponding path program 1 times [2023-02-15 01:06:16,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:16,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822252712] [2023-02-15 01:06:16,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:16,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:16,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:16,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822252712] [2023-02-15 01:06:16,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822252712] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:16,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:16,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:06:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137797738] [2023-02-15 01:06:16,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:16,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:06:16,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:16,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:06:16,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:06:16,753 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) [2023-02-15 01:06:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:16,861 INFO L93 Difference]: Finished difference Result 191 states and 235 transitions. [2023-02-15 01:06:16,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:06:16,862 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 [2023-02-15 01:06:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:16,862 INFO L225 Difference]: With dead ends: 191 [2023-02-15 01:06:16,862 INFO L226 Difference]: Without dead ends: 191 [2023-02-15 01:06:16,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:06:16,863 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 23 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:16,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 399 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:06:16,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-15 01:06:16,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2023-02-15 01:06:16,865 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) [2023-02-15 01:06:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2023-02-15 01:06:16,866 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 23 [2023-02-15 01:06:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:16,866 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2023-02-15 01:06:16,866 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) [2023-02-15 01:06:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2023-02-15 01:06:16,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 01:06:16,866 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:16,866 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:06:16,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 01:06:16,867 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)] === [2023-02-15 01:06:16,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash -165115758, now seen corresponding path program 1 times [2023-02-15 01:06:16,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:16,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313575546] [2023-02-15 01:06:16,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:16,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:17,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:17,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313575546] [2023-02-15 01:06:17,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313575546] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:17,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:17,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 01:06:17,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326184863] [2023-02-15 01:06:17,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:17,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:06:17,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:17,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:06:17,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:06:17,146 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) [2023-02-15 01:06:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:17,603 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2023-02-15 01:06:17,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 01:06:17,603 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 01:06:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:17,604 INFO L225 Difference]: With dead ends: 228 [2023-02-15 01:06:17,604 INFO L226 Difference]: Without dead ends: 228 [2023-02-15 01:06:17,604 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 [2023-02-15 01:06:17,605 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 117 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:17,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 491 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 01:06:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-02-15 01:06:17,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 177. [2023-02-15 01:06:17,607 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) [2023-02-15 01:06:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2023-02-15 01:06:17,607 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 26 [2023-02-15 01:06:17,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:17,607 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2023-02-15 01:06:17,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:06:17,608 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2023-02-15 01:06:17,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 01:06:17,608 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:17,608 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:06:17,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 01:06:17,608 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)] === [2023-02-15 01:06:17,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:17,612 INFO L85 PathProgramCache]: Analyzing trace with hash -165115757, now seen corresponding path program 1 times [2023-02-15 01:06:17,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:17,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718353788] [2023-02-15 01:06:17,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:17,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:18,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:18,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718353788] [2023-02-15 01:06:18,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718353788] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:18,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:18,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:06:18,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943846390] [2023-02-15 01:06:18,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:18,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:06:18,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:18,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:06:18,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:06:18,024 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) [2023-02-15 01:06:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:18,416 INFO L93 Difference]: Finished difference Result 207 states and 251 transitions. [2023-02-15 01:06:18,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 01:06:18,416 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 01:06:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:18,417 INFO L225 Difference]: With dead ends: 207 [2023-02-15 01:06:18,417 INFO L226 Difference]: Without dead ends: 207 [2023-02-15 01:06:18,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-02-15 01:06:18,418 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 76 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:18,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 353 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:06:18,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-15 01:06:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 177. [2023-02-15 01:06:18,421 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) [2023-02-15 01:06:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 222 transitions. [2023-02-15 01:06:18,422 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 222 transitions. Word has length 26 [2023-02-15 01:06:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:18,422 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 222 transitions. [2023-02-15 01:06:18,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:06:18,422 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 222 transitions. [2023-02-15 01:06:18,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 01:06:18,424 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:18,424 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] [2023-02-15 01:06:18,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 01:06:18,424 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)] === [2023-02-15 01:06:18,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash -823622550, now seen corresponding path program 1 times [2023-02-15 01:06:18,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:18,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312752985] [2023-02-15 01:06:18,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:18,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:18,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:18,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312752985] [2023-02-15 01:06:18,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312752985] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:18,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:18,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:06:18,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400450046] [2023-02-15 01:06:18,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:18,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:06:18,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:18,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:06:18,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:06:18,586 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) [2023-02-15 01:06:18,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:18,716 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2023-02-15 01:06:18,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 01:06:18,716 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 [2023-02-15 01:06:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:18,717 INFO L225 Difference]: With dead ends: 194 [2023-02-15 01:06:18,717 INFO L226 Difference]: Without dead ends: 194 [2023-02-15 01:06:18,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-02-15 01:06:18,718 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 34 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:18,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 406 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:06:18,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-15 01:06:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2023-02-15 01:06:18,721 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) [2023-02-15 01:06:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 221 transitions. [2023-02-15 01:06:18,721 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 221 transitions. Word has length 27 [2023-02-15 01:06:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:18,722 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 221 transitions. [2023-02-15 01:06:18,722 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) [2023-02-15 01:06:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 221 transitions. [2023-02-15 01:06:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 01:06:18,722 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:18,722 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:06:18,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 01:06:18,723 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)] === [2023-02-15 01:06:18,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:18,723 INFO L85 PathProgramCache]: Analyzing trace with hash 237551634, now seen corresponding path program 1 times [2023-02-15 01:06:18,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:18,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38656012] [2023-02-15 01:06:18,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:18,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:18,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:18,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38656012] [2023-02-15 01:06:18,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38656012] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:18,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:18,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:06:18,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119462334] [2023-02-15 01:06:18,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:18,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:06:18,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:18,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:06:18,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:06:18,881 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) [2023-02-15 01:06:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:19,097 INFO L93 Difference]: Finished difference Result 229 states and 275 transitions. [2023-02-15 01:06:19,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 01:06:19,097 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 [2023-02-15 01:06:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:19,098 INFO L225 Difference]: With dead ends: 229 [2023-02-15 01:06:19,098 INFO L226 Difference]: Without dead ends: 229 [2023-02-15 01:06:19,098 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 [2023-02-15 01:06:19,099 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 176 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:19,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 569 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:06:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-02-15 01:06:19,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 179. [2023-02-15 01:06:19,101 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) [2023-02-15 01:06:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 223 transitions. [2023-02-15 01:06:19,102 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 223 transitions. Word has length 28 [2023-02-15 01:06:19,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:19,102 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 223 transitions. [2023-02-15 01:06:19,102 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) [2023-02-15 01:06:19,102 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 223 transitions. [2023-02-15 01:06:19,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 01:06:19,102 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:19,103 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] [2023-02-15 01:06:19,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 01:06:19,103 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)] === [2023-02-15 01:06:19,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:19,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1225833714, now seen corresponding path program 1 times [2023-02-15 01:06:19,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:19,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648727602] [2023-02-15 01:06:19,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:19,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:19,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:19,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:19,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648727602] [2023-02-15 01:06:19,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648727602] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:19,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:19,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:06:19,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781053338] [2023-02-15 01:06:19,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:19,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:06:19,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:19,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:06:19,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:06:19,268 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) [2023-02-15 01:06:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:19,470 INFO L93 Difference]: Finished difference Result 200 states and 244 transitions. [2023-02-15 01:06:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 01:06:19,471 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 [2023-02-15 01:06:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:19,472 INFO L225 Difference]: With dead ends: 200 [2023-02-15 01:06:19,472 INFO L226 Difference]: Without dead ends: 200 [2023-02-15 01:06:19,472 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 [2023-02-15 01:06:19,472 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 46 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:19,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 481 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:06:19,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-15 01:06:19,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2023-02-15 01:06:19,474 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) [2023-02-15 01:06:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2023-02-15 01:06:19,475 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 29 [2023-02-15 01:06:19,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:19,475 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2023-02-15 01:06:19,475 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) [2023-02-15 01:06:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2023-02-15 01:06:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 01:06:19,475 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:19,475 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] [2023-02-15 01:06:19,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 01:06:19,476 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)] === [2023-02-15 01:06:19,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:19,476 INFO L85 PathProgramCache]: Analyzing trace with hash 653860756, now seen corresponding path program 1 times [2023-02-15 01:06:19,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:19,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749325355] [2023-02-15 01:06:19,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:19,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 01:06:19,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:19,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749325355] [2023-02-15 01:06:19,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749325355] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:19,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:19,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:06:19,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443970728] [2023-02-15 01:06:19,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:19,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:06:19,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:19,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:06:19,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:06:19,506 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) [2023-02-15 01:06:19,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:19,621 INFO L93 Difference]: Finished difference Result 251 states and 315 transitions. [2023-02-15 01:06:19,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:06:19,621 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 [2023-02-15 01:06:19,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:19,622 INFO L225 Difference]: With dead ends: 251 [2023-02-15 01:06:19,622 INFO L226 Difference]: Without dead ends: 251 [2023-02-15 01:06:19,622 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 [2023-02-15 01:06:19,623 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 [2023-02-15 01:06:19,623 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] [2023-02-15 01:06:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-02-15 01:06:19,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 184. [2023-02-15 01:06:19,625 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) [2023-02-15 01:06:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 235 transitions. [2023-02-15 01:06:19,625 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 235 transitions. Word has length 30 [2023-02-15 01:06:19,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:19,626 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 235 transitions. [2023-02-15 01:06:19,626 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) [2023-02-15 01:06:19,626 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 235 transitions. [2023-02-15 01:06:19,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 01:06:19,626 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:19,626 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] [2023-02-15 01:06:19,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 01:06:19,626 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)] === [2023-02-15 01:06:19,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:19,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1294968215, now seen corresponding path program 1 times [2023-02-15 01:06:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:19,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097872020] [2023-02-15 01:06:19,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:19,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:20,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:20,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097872020] [2023-02-15 01:06:20,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097872020] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:06:20,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125719897] [2023-02-15 01:06:20,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:20,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:06:20,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:06:20,092 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:06:20,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 01:06:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:20,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 01:06:20,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:06:20,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:06:20,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:06:20,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 01:06:20,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 01:06:20,323 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:06:20,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 01:06:20,363 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:06:20,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 01:06:20,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 01:06:20,445 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 01:06:20,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 36 [2023-02-15 01:06:20,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:06:20,989 INFO L321 Elim1Store]: treesize reduction 85, result has 44.4 percent of original size [2023-02-15 01:06:20,989 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 01:06:21,005 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:06:21,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 52 [2023-02-15 01:06:21,031 INFO L321 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2023-02-15 01:06:21,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 60 [2023-02-15 01:06:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:21,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:06:21,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 01:06:21,747 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2023-02-15 01:06:21,748 INFO L350 Elim1Store]: Elim1 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 59 treesize of output 64 [2023-02-15 01:06:21,760 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 01:06:21,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2023-02-15 01:06:22,000 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) (let ((.cse5 (not .cse0)) (.cse1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (and (or .cse0 (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse2 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 .cse1) |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) .cse2) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse2)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse4 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 .cse1) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse3 .cse4) 0) 0) (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse4)))))) (or .cse5 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_19 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (not (= (select v_arrayElimArr_1 .cse1) |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 .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_19) (= (select (select .cse6 v_arrayElimCell_19) 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_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse7 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))))) (or .cse0 (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 .cse1) |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 .cse5 (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)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_19 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (not (= (select v_arrayElimArr_1 .cse1) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse9 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse9 v_arrayElimCell_19) 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 .cse1) |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 .cse1) |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)))))) .cse5) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse11 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 .cse1) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse10 .cse11) 0) 0) (= (select (select .cse10 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse11)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (or .cse5 (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 ((.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| |c_ULTIMATE.start_main_~item~0#1.base|))))) (or .cse0 (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 .cse5 (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= (select v_arrayElimArr_1 .cse1) |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)))) (or .cse0 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse13 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse13 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)))))))) is different from false [2023-02-15 01:06:22,281 WARN L837 $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_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_19 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse2 v_arrayElimCell_19) 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_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse3 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_19 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))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse4 |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| v_arrayElimCell_19) (= (select (select .cse4 v_arrayElimCell_19) 0) 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|))) (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 [2023-02-15 01:06:22,372 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (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 .cse0 .cse1 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 ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse3 .cse1 v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= 0 (select (select .cse2 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 .cse3 .cse1 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 .cse0 .cse1 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 ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse3 .cse1 v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= 0 (select (select .cse4 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 .cse3 .cse1 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)) (v_arrayElimCell_19 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse0 .cse1 v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse5 |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|)) (= (select (select .cse5 v_arrayElimCell_19) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_19)))) (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)) (v_arrayElimCell_19 Int)) (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse0 .cse1 v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse6 v_arrayElimCell_19) 0) 0)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_1 4))) (or (not (= .cse7 |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 .cse0 .cse1 v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse7) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))))) is different from false [2023-02-15 01:06:22,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:06:22,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 45 [2023-02-15 01:06:22,486 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:06:22,497 INFO L321 Elim1Store]: treesize reduction 18, result has 43.8 percent of original size [2023-02-15 01:06:22,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 38 [2023-02-15 01:06:22,501 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:06:22,503 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2023-02-15 01:06:22,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 1 [2023-02-15 01:06:22,505 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:06:22,508 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 01:06:22,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2023-02-15 01:06:22,511 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:06:22,512 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 01:06:22,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 1 [2023-02-15 01:06:22,515 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:06:22,516 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2023-02-15 01:06:22,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2023-02-15 01:06:22,521 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:06:22,524 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 01:06:22,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2023-02-15 01:06:22,527 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:06:22,529 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 01:06:22,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 1 [2023-02-15 01:06:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:22,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125719897] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:06:22,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:06:22,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 41 [2023-02-15 01:06:22,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028889415] [2023-02-15 01:06:22,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:06:22,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 01:06:22,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:22,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 01:06:22,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1256, Unknown=5, NotChecked=222, Total=1640 [2023-02-15 01:06:22,533 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) [2023-02-15 01:06:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:24,537 INFO L93 Difference]: Finished difference Result 214 states and 266 transitions. [2023-02-15 01:06:24,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 01:06:24,538 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 [2023-02-15 01:06:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:24,538 INFO L225 Difference]: With dead ends: 214 [2023-02-15 01:06:24,538 INFO L226 Difference]: Without dead ends: 214 [2023-02-15 01:06:24,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=415, Invalid=2672, Unknown=5, NotChecked=330, Total=3422 [2023-02-15 01:06:24,540 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 285 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 44 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 349 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:24,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1498 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1464 Invalid, 4 Unknown, 349 Unchecked, 0.8s Time] [2023-02-15 01:06:24,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-02-15 01:06:24,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 186. [2023-02-15 01:06:24,542 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) [2023-02-15 01:06:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 237 transitions. [2023-02-15 01:06:24,542 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 237 transitions. Word has length 32 [2023-02-15 01:06:24,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:24,543 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 237 transitions. [2023-02-15 01:06:24,543 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) [2023-02-15 01:06:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 237 transitions. [2023-02-15 01:06:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 01:06:24,543 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:24,543 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] [2023-02-15 01:06:24,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 01:06:24,748 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 [2023-02-15 01:06:24,748 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)] === [2023-02-15 01:06:24,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:24,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1489307653, now seen corresponding path program 1 times [2023-02-15 01:06:24,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:24,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164737988] [2023-02-15 01:06:24,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:24,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:25,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:25,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164737988] [2023-02-15 01:06:25,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164737988] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:06:25,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072371701] [2023-02-15 01:06:25,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:25,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:06:25,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:06:25,075 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:06:25,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 01:06:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:25,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 01:06:25,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:06:25,183 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:06:25,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 18 treesize of output 32 [2023-02-15 01:06:25,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:06:25,313 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:06:25,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2023-02-15 01:06:25,419 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:06:25,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2023-02-15 01:06:25,533 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:06:25,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 30 treesize of output 39 [2023-02-15 01:06:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:25,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:06:25,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2023-02-15 01:06:35,987 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification. DAG size of input: 48 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 01:06:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:38,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072371701] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:06:38,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:06:38,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 32 [2023-02-15 01:06:38,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155855394] [2023-02-15 01:06:38,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:06:38,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 01:06:38,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:38,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 01:06:38,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2023-02-15 01:06:38,314 INFO L87 Difference]: Start difference. First operand 186 states and 237 transitions. Second operand has 33 states, 32 states have (on average 2.71875) internal successors, (87), 33 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:06:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:39,367 INFO L93 Difference]: Finished difference Result 188 states and 238 transitions. [2023-02-15 01:06:39,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 01:06:39,367 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 33 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-15 01:06:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:39,368 INFO L225 Difference]: With dead ends: 188 [2023-02-15 01:06:39,368 INFO L226 Difference]: Without dead ends: 171 [2023-02-15 01:06:39,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=269, Invalid=1537, Unknown=0, NotChecked=0, Total=1806 [2023-02-15 01:06:39,369 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 73 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:39,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 802 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 01:06:39,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-15 01:06:39,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2023-02-15 01:06:39,371 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) [2023-02-15 01:06:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 221 transitions. [2023-02-15 01:06:39,371 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 221 transitions. Word has length 33 [2023-02-15 01:06:39,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:39,371 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 221 transitions. [2023-02-15 01:06:39,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 33 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:06:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 221 transitions. [2023-02-15 01:06:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 01:06:39,372 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:39,372 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] [2023-02-15 01:06:39,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 01:06:39,577 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 [2023-02-15 01:06:39,577 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)] === [2023-02-15 01:06:39,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:39,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1756679628, now seen corresponding path program 1 times [2023-02-15 01:06:39,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:39,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490351120] [2023-02-15 01:06:39,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:39,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:39,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:39,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490351120] [2023-02-15 01:06:39,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490351120] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:06:39,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283656547] [2023-02-15 01:06:39,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:39,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:06:39,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:06:39,812 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:06:39,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 01:06:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:39,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 01:06:39,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:06:39,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:06:39,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:06:39,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:06:39,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2023-02-15 01:06:40,005 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-15 01:06:40,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-02-15 01:06:40,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:06:40,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 01:06:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:40,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:06:40,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283656547] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:40,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:06:40,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 17 [2023-02-15 01:06:40,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768047271] [2023-02-15 01:06:40,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:40,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:06:40,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:40,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:06:40,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-02-15 01:06:40,120 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) [2023-02-15 01:06:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:40,397 INFO L93 Difference]: Finished difference Result 210 states and 237 transitions. [2023-02-15 01:06:40,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 01:06:40,398 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 [2023-02-15 01:06:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:40,398 INFO L225 Difference]: With dead ends: 210 [2023-02-15 01:06:40,398 INFO L226 Difference]: Without dead ends: 210 [2023-02-15 01:06:40,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2023-02-15 01:06:40,399 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 382 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:40,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 431 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:06:40,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-02-15 01:06:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 171. [2023-02-15 01:06:40,401 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) [2023-02-15 01:06:40,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 220 transitions. [2023-02-15 01:06:40,401 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 220 transitions. Word has length 37 [2023-02-15 01:06:40,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:40,402 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 220 transitions. [2023-02-15 01:06:40,402 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) [2023-02-15 01:06:40,402 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 220 transitions. [2023-02-15 01:06:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 01:06:40,402 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:40,402 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] [2023-02-15 01:06:40,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 01:06:40,607 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 [2023-02-15 01:06:40,607 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)] === [2023-02-15 01:06:40,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1756679629, now seen corresponding path program 1 times [2023-02-15 01:06:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:40,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457617631] [2023-02-15 01:06:40,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:40,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:40,765 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:40,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:40,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457617631] [2023-02-15 01:06:40,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457617631] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:06:40,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754605966] [2023-02-15 01:06:40,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:40,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:06:40,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:06:40,783 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:06:40,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 01:06:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:40,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 01:06:40,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:06:40,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:06:40,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:06:40,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:06:41,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:06:41,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2023-02-15 01:06:41,018 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-15 01:06:41,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2023-02-15 01:06:41,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:06:41,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 01:06:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:41,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:06:41,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754605966] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:41,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:06:41,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2023-02-15 01:06:41,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663714030] [2023-02-15 01:06:41,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:41,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:06:41,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:41,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:06:41,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2023-02-15 01:06:41,112 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) [2023-02-15 01:06:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:41,369 INFO L93 Difference]: Finished difference Result 196 states and 223 transitions. [2023-02-15 01:06:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 01:06:41,371 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 [2023-02-15 01:06:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:41,372 INFO L225 Difference]: With dead ends: 196 [2023-02-15 01:06:41,372 INFO L226 Difference]: Without dead ends: 196 [2023-02-15 01:06:41,372 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 [2023-02-15 01:06:41,372 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 262 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:41,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 469 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:06:41,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-15 01:06:41,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 171. [2023-02-15 01:06:41,374 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) [2023-02-15 01:06:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 219 transitions. [2023-02-15 01:06:41,375 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 219 transitions. Word has length 37 [2023-02-15 01:06:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:41,375 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 219 transitions. [2023-02-15 01:06:41,375 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) [2023-02-15 01:06:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 219 transitions. [2023-02-15 01:06:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 01:06:41,375 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:41,375 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] [2023-02-15 01:06:41,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 01:06:41,581 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 [2023-02-15 01:06:41,581 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)] === [2023-02-15 01:06:41,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:41,582 INFO L85 PathProgramCache]: Analyzing trace with hash 507133380, now seen corresponding path program 1 times [2023-02-15 01:06:41,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:41,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526356585] [2023-02-15 01:06:41,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:41,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:41,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:41,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526356585] [2023-02-15 01:06:41,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526356585] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:06:41,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691817787] [2023-02-15 01:06:41,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:41,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:06:41,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:06:41,725 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:06:41,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 01:06:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:41,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 01:06:41,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:06:41,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:06:41,871 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:06:41,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 01:06:41,880 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:06:41,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:06:41,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:06:41,897 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:06:41,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-15 01:06:41,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 01:06:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:41,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:06:41,915 WARN L837 $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 [2023-02-15 01:06:41,918 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:06:41,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-02-15 01:06:41,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-02-15 01:06:41,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-15 01:06:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-15 01:06:41,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691817787] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:06:41,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:06:41,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2023-02-15 01:06:41,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748213998] [2023-02-15 01:06:41,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:06:41,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 01:06:41,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:41,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 01:06:41,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2023-02-15 01:06:41,963 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) [2023-02-15 01:06:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:42,190 INFO L93 Difference]: Finished difference Result 171 states and 216 transitions. [2023-02-15 01:06:42,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 01:06:42,191 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 [2023-02-15 01:06:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:42,192 INFO L225 Difference]: With dead ends: 171 [2023-02-15 01:06:42,192 INFO L226 Difference]: Without dead ends: 171 [2023-02-15 01:06:42,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=272, Unknown=1, NotChecked=36, Total=420 [2023-02-15 01:06:42,192 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 132 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:42,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 542 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 407 Invalid, 0 Unknown, 85 Unchecked, 0.2s Time] [2023-02-15 01:06:42,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-15 01:06:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2023-02-15 01:06:42,194 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) [2023-02-15 01:06:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 214 transitions. [2023-02-15 01:06:42,194 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 214 transitions. Word has length 40 [2023-02-15 01:06:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:42,194 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 214 transitions. [2023-02-15 01:06:42,194 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) [2023-02-15 01:06:42,195 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 214 transitions. [2023-02-15 01:06:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 01:06:42,195 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:42,195 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] [2023-02-15 01:06:42,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 01:06:42,400 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 [2023-02-15 01:06:42,401 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)] === [2023-02-15 01:06:42,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:42,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1119299147, now seen corresponding path program 1 times [2023-02-15 01:06:42,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:42,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073461618] [2023-02-15 01:06:42,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:42,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 01:06:42,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:42,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073461618] [2023-02-15 01:06:42,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073461618] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:42,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:06:42,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:06:42,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352540917] [2023-02-15 01:06:42,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:42,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:06:42,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:42,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:06:42,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:06:42,491 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) [2023-02-15 01:06:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:42,604 INFO L93 Difference]: Finished difference Result 166 states and 212 transitions. [2023-02-15 01:06:42,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:06:42,605 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 [2023-02-15 01:06:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:42,605 INFO L225 Difference]: With dead ends: 166 [2023-02-15 01:06:42,605 INFO L226 Difference]: Without dead ends: 166 [2023-02-15 01:06:42,605 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 [2023-02-15 01:06:42,606 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 27 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:42,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 305 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:06:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-02-15 01:06:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-02-15 01:06:42,608 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) [2023-02-15 01:06:42,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 212 transitions. [2023-02-15 01:06:42,608 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 212 transitions. Word has length 41 [2023-02-15 01:06:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:42,608 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 212 transitions. [2023-02-15 01:06:42,608 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) [2023-02-15 01:06:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 212 transitions. [2023-02-15 01:06:42,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 01:06:42,609 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:42,609 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] [2023-02-15 01:06:42,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-15 01:06:42,609 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)] === [2023-02-15 01:06:42,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:42,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1119299146, now seen corresponding path program 1 times [2023-02-15 01:06:42,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:42,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451542614] [2023-02-15 01:06:42,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:42,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:42,826 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:42,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:42,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451542614] [2023-02-15 01:06:42,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451542614] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:06:42,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550597843] [2023-02-15 01:06:42,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:42,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:06:42,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:06:42,841 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:06:42,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 01:06:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:42,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 01:06:42,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:06:43,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:06:43,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:06:43,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 01:06:43,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-15 01:06:43,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 01:06:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:43,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:06:43,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550597843] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:06:43,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:06:43,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2023-02-15 01:06:43,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739221784] [2023-02-15 01:06:43,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:06:43,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 01:06:43,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:43,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 01:06:43,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2023-02-15 01:06:43,193 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) [2023-02-15 01:06:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:43,484 INFO L93 Difference]: Finished difference Result 226 states and 253 transitions. [2023-02-15 01:06:43,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 01:06:43,484 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 [2023-02-15 01:06:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:43,485 INFO L225 Difference]: With dead ends: 226 [2023-02-15 01:06:43,485 INFO L226 Difference]: Without dead ends: 226 [2023-02-15 01:06:43,485 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 [2023-02-15 01:06:43,486 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 416 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:43,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 387 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:06:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-02-15 01:06:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 166. [2023-02-15 01:06:43,488 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) [2023-02-15 01:06:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2023-02-15 01:06:43,488 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 41 [2023-02-15 01:06:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:43,488 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2023-02-15 01:06:43,488 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) [2023-02-15 01:06:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2023-02-15 01:06:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 01:06:43,489 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:43,489 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] [2023-02-15 01:06:43,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 01:06:43,694 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 [2023-02-15 01:06:43,694 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)] === [2023-02-15 01:06:43,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:43,694 INFO L85 PathProgramCache]: Analyzing trace with hash -716785192, now seen corresponding path program 1 times [2023-02-15 01:06:43,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:43,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742589123] [2023-02-15 01:06:43,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:43,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:43,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:43,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742589123] [2023-02-15 01:06:43,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742589123] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:06:43,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966678413] [2023-02-15 01:06:43,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:43,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:06:43,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:06:43,934 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:06:43,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 01:06:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:44,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 01:06:44,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:06:44,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:06:44,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:06:44,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:06:44,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 01:06:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:44,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:06:44,292 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:44,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966678413] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:06:44,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:06:44,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2023-02-15 01:06:44,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910884910] [2023-02-15 01:06:44,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:06:44,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 01:06:44,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:06:44,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 01:06:44,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2023-02-15 01:06:44,299 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) [2023-02-15 01:06:44,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:06:44,825 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2023-02-15 01:06:44,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 01:06:44,826 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 [2023-02-15 01:06:44,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:06:44,827 INFO L225 Difference]: With dead ends: 186 [2023-02-15 01:06:44,827 INFO L226 Difference]: Without dead ends: 186 [2023-02-15 01:06:44,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=343, Invalid=1217, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 01:06:44,828 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 509 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:06:44,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 614 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:06:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-15 01:06:44,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 166. [2023-02-15 01:06:44,833 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) [2023-02-15 01:06:44,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 209 transitions. [2023-02-15 01:06:44,833 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 209 transitions. Word has length 45 [2023-02-15 01:06:44,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:06:44,833 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 209 transitions. [2023-02-15 01:06:44,834 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) [2023-02-15 01:06:44,834 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 209 transitions. [2023-02-15 01:06:44,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 01:06:44,834 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:06:44,834 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] [2023-02-15 01:06:44,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 01:06:45,055 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 [2023-02-15 01:06:45,055 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)] === [2023-02-15 01:06:45,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:06:45,056 INFO L85 PathProgramCache]: Analyzing trace with hash 829868235, now seen corresponding path program 1 times [2023-02-15 01:06:45,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:06:45,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737831697] [2023-02-15 01:06:45,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:45,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:06:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:45,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:06:45,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737831697] [2023-02-15 01:06:45,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737831697] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:06:45,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513207002] [2023-02-15 01:06:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:06:45,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:06:45,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:06:45,789 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:06:45,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 01:06:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:06:45,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-15 01:06:45,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:06:45,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:06:45,959 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:06:45,959 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 01:06:45,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:06:46,048 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-02-15 01:06:46,048 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 01:06:46,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-15 01:06:46,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-15 01:06:46,165 INFO L321 Elim1Store]: treesize reduction 78, result has 31.6 percent of original size [2023-02-15 01:06:46,166 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 01:06:46,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-15 01:06:46,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:06:46,293 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 01:06:46,343 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:06:46,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 49 [2023-02-15 01:06:46,684 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:06:46,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:06:46,686 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 01:06:46,689 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 01:06:46,887 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:06:46,887 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 01:06:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:06:46,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:06:47,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-02-15 01:06:47,256 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse0 (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1368 Int)) (= 1 (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1368) (select .cse4 .cse3))))))) (and (or (< 0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 1)) .cse0) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| 1) .cse0) (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1368 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (= .cse1 |c_ULTIMATE.start_main_~data~0#1.base|) (= 1 (select (store |c_#valid| .cse1 v_ArrVal_1368) (select .cse2 .cse3)))))))))) is different from false [2023-02-15 01:06:47,267 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)))) (let ((.cse4 (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1368 Int)) (= (let ((.cse5 (select (store .cse3 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse5 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1368) (select .cse5 .cse2))) 1)))) (and (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1368 Int)) (let ((.cse1 (select (store .cse3 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (= (select (store |c_#valid| .cse0 v_ArrVal_1368) (select .cse1 .cse2)) 1) (= |c_ULTIMATE.start_main_~data~0#1.base| .cse0))))) (or (< 0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 1)) .cse4) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| 1) .cse4)))) is different from false [2023-02-15 01:06:47,291 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse0 (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1368 Int)) (= (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1364))) (store .cse6 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse5 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1368) (select .cse5 .cse3))) 1)))) (and (or (< 0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 1)) .cse0) (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1368 Int)) (let ((.cse2 (select (store (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|))) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |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_1368) (select .cse2 .cse3)) 1) (= .cse1 |c_ULTIMATE.start_main_~data~0#1.base|))))) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| 1) .cse0)))) is different from false [2023-02-15 01:06:47,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:06:47,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 111 [2023-02-15 01:06:47,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:06:47,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 577 treesize of output 570 [2023-02-15 01:06:47,724 INFO L350 Elim1Store]: Elim1 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 555 treesize of output 491 [2023-02-15 01:06:47,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 374 treesize of output 366 [2023-02-15 01:06:47,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 366 treesize of output 350 [2023-02-15 01:08:06,682 WARN L233 SmtUtils]: Spent 38.39s on a formula simplification. DAG size of input: 420 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 01:08:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-15 01:08:07,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513207002] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:08:07,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:08:07,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 21] total 51 [2023-02-15 01:08:07,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060521038] [2023-02-15 01:08:07,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:08:07,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 01:08:07,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:08:07,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 01:08:07,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2076, Unknown=5, NotChecked=288, Total=2652 [2023-02-15 01:08:07,415 INFO L87 Difference]: Start difference. First operand 166 states and 209 transitions. Second operand has 52 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 52 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) [2023-02-15 01:08:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:08:13,951 INFO L93 Difference]: Finished difference Result 270 states and 326 transitions. [2023-02-15 01:08:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 01:08:13,951 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 52 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 [2023-02-15 01:08:13,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:08:13,952 INFO L225 Difference]: With dead ends: 270 [2023-02-15 01:08:13,952 INFO L226 Difference]: Without dead ends: 270 [2023-02-15 01:08:13,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 46.3s TimeCoverageRelationStatistics Valid=662, Invalid=3764, Unknown=8, NotChecked=396, Total=4830 [2023-02-15 01:08:13,954 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 399 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 64 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 2307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 541 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:08:13,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 958 Invalid, 2307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1693 Invalid, 9 Unknown, 541 Unchecked, 1.3s Time] [2023-02-15 01:08:13,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-15 01:08:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 164. [2023-02-15 01:08:13,961 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) [2023-02-15 01:08:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2023-02-15 01:08:13,961 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 48 [2023-02-15 01:08:13,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:08:13,961 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2023-02-15 01:08:13,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 52 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) [2023-02-15 01:08:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2023-02-15 01:08:13,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 01:08:13,962 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:08:13,962 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] [2023-02-15 01:08:13,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 01:08:14,167 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 [2023-02-15 01:08:14,168 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)] === [2023-02-15 01:08:14,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:08:14,168 INFO L85 PathProgramCache]: Analyzing trace with hash 829868236, now seen corresponding path program 1 times [2023-02-15 01:08:14,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:08:14,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480728103] [2023-02-15 01:08:14,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:08:14,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:08:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:08:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:08:15,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:08:15,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480728103] [2023-02-15 01:08:15,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480728103] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:08:15,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237412455] [2023-02-15 01:08:15,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:08:15,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:08:15,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:08:15,169 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:08:15,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 01:08:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:08:15,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 77 conjunts are in the unsatisfiable core [2023-02-15 01:08:15,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:08:15,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:08:15,372 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:08:15,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 01:08:15,381 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2023-02-15 01:08:15,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:08:15,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:08:15,526 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 01:08:15,526 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 01:08:15,555 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-02-15 01:08:15,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-02-15 01:08:15,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2023-02-15 01:08:15,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:08:15,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:08:15,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2023-02-15 01:08:15,722 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 01:08:15,723 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 01:08:15,744 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 01:08:15,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 01:08:15,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:08:15,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-15 01:08:15,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:08:15,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2023-02-15 01:08:15,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:08:15,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 01:08:15,956 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:08:15,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2023-02-15 01:08:15,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-02-15 01:08:16,192 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:08:16,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:08:16,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 31 [2023-02-15 01:08:16,330 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:08:16,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:08:16,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2023-02-15 01:08:16,526 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:08:16,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:08:22,730 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:08:22,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 309 treesize of output 279 [2023-02-15 01:08:22,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:08:22,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 461 treesize of output 311 [2023-02-15 01:08:22,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:08:22,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1215 treesize of output 1214 [2023-02-15 01:08:22,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:08:22,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7757 treesize of output 7695 [2023-02-15 01:08:22,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2122 treesize of output 2058 [2023-02-15 01:08:22,830 INFO L350 Elim1Store]: Elim1 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 9267 treesize of output 8867 [2023-02-15 01:08:22,842 INFO L350 Elim1Store]: Elim1 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 8299 treesize of output 7771 [2023-02-15 01:08:22,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8541 treesize of output 8445 [2023-02-15 01:08:22,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4438 treesize of output 4254 [2023-02-15 01:08:22,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4