./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 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-ext/dll_extends_pointer.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 b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 21:56:18,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 21:56:18,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 21:56:18,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 21:56:18,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 21:56:18,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 21:56:18,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 21:56:18,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 21:56:18,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 21:56:18,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 21:56:18,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 21:56:18,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 21:56:18,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 21:56:18,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 21:56:18,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 21:56:18,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 21:56:18,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 21:56:18,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 21:56:18,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 21:56:18,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 21:56:18,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 21:56:18,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 21:56:18,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 21:56:18,170 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 21:56:18,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 21:56:18,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 21:56:18,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 21:56:18,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 21:56:18,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 21:56:18,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 21:56:18,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 21:56:18,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 21:56:18,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 21:56:18,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 21:56:18,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 21:56:18,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 21:56:18,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 21:56:18,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 21:56:18,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 21:56:18,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 21:56:18,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 21:56:18,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 21:56:18,205 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 21:56:18,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 21:56:18,206 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 21:56:18,206 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 21:56:18,207 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 21:56:18,207 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 21:56:18,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 21:56:18,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 21:56:18,207 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 21:56:18,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 21:56:18,208 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 21:56:18,208 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 21:56:18,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 21:56:18,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 21:56:18,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 21:56:18,209 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 21:56:18,209 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 21:56:18,209 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 21:56:18,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 21:56:18,209 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 21:56:18,209 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 21:56:18,210 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 21:56:18,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 21:56:18,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 21:56:18,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 21:56:18,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:56:18,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 21:56:18,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 21:56:18,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 21:56:18,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 21:56:18,211 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 21:56:18,211 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 21:56:18,211 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 21:56:18,211 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 21:56:18,212 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 -> b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 [2023-02-15 21:56:18,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 21:56:18,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 21:56:18,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 21:56:18,385 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 21:56:18,385 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 21:56:18,386 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2023-02-15 21:56:19,404 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 21:56:19,580 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 21:56:19,580 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2023-02-15 21:56:19,591 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e37142fdd/35452bc73c804b28a384e6ccb580a805/FLAG439bd9257 [2023-02-15 21:56:19,606 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e37142fdd/35452bc73c804b28a384e6ccb580a805 [2023-02-15 21:56:19,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 21:56:19,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 21:56:19,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 21:56:19,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 21:56:19,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 21:56:19,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:56:19" (1/1) ... [2023-02-15 21:56:19,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7a8250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:56:19, skipping insertion in model container [2023-02-15 21:56:19,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:56:19" (1/1) ... [2023-02-15 21:56:19,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 21:56:19,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:56:19,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:56:19,836 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 21:56:19,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:56:19,894 INFO L208 MainTranslator]: Completed translation [2023-02-15 21:56:19,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:56:19 WrapperNode [2023-02-15 21:56:19,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 21:56:19,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 21:56:19,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 21:56:19,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 21:56:19,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:56:19" (1/1) ... [2023-02-15 21:56:19,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:56:19" (1/1) ... [2023-02-15 21:56:19,936 INFO L138 Inliner]: procedures = 123, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2023-02-15 21:56:19,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 21:56:19,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 21:56:19,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 21:56:19,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 21:56:19,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:56:19" (1/1) ... [2023-02-15 21:56:19,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:56:19" (1/1) ... [2023-02-15 21:56:19,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:56:19" (1/1) ... [2023-02-15 21:56:19,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:56:19" (1/1) ... [2023-02-15 21:56:19,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:56:19" (1/1) ... [2023-02-15 21:56:19,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:56:19" (1/1) ... [2023-02-15 21:56:19,971 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:56:19" (1/1) ... [2023-02-15 21:56:19,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:56:19" (1/1) ... [2023-02-15 21:56:19,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 21:56:19,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 21:56:19,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 21:56:19,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 21:56:19,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:56:19" (1/1) ... [2023-02-15 21:56:19,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:56:19,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:56:20,018 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 21:56:20,063 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 21:56:20,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 21:56:20,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 21:56:20,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 21:56:20,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 21:56:20,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 21:56:20,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 21:56:20,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 21:56:20,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 21:56:20,169 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 21:56:20,171 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 21:56:20,340 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 21:56:20,344 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 21:56:20,345 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 21:56:20,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:56:20 BoogieIcfgContainer [2023-02-15 21:56:20,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 21:56:20,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 21:56:20,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 21:56:20,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 21:56:20,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 09:56:19" (1/3) ... [2023-02-15 21:56:20,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1877d37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:56:20, skipping insertion in model container [2023-02-15 21:56:20,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:56:19" (2/3) ... [2023-02-15 21:56:20,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1877d37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:56:20, skipping insertion in model container [2023-02-15 21:56:20,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:56:20" (3/3) ... [2023-02-15 21:56:20,351 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2023-02-15 21:56:20,362 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 21:56:20,362 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2023-02-15 21:56:20,390 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 21:56:20,394 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;@39b78d87, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 21:56:20,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2023-02-15 21:56:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 31 states have (on average 2.064516129032258) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 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 21:56:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 21:56:20,400 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:20,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 21:56:20,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:20,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 21:56:20,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:20,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304185749] [2023-02-15 21:56:20,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:20,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:20,555 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 21:56:20,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:20,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304185749] [2023-02-15 21:56:20,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304185749] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:20,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:20,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:56:20,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937188462] [2023-02-15 21:56:20,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:20,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:56:20,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:20,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:56:20,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:56:20,592 INFO L87 Difference]: Start difference. First operand has 59 states, 31 states have (on average 2.064516129032258) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:20,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:20,696 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2023-02-15 21:56:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:56:20,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-15 21:56:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:20,703 INFO L225 Difference]: With dead ends: 63 [2023-02-15 21:56:20,703 INFO L226 Difference]: Without dead ends: 59 [2023-02-15 21:56:20,704 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 21:56:20,706 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:20,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 33 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:56:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-15 21:56:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2023-02-15 21:56:20,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 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 21:56:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2023-02-15 21:56:20,725 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 3 [2023-02-15 21:56:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:20,726 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2023-02-15 21:56:20,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2023-02-15 21:56:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 21:56:20,726 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:20,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 21:56:20,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 21:56:20,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:20,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 21:56:20,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:20,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191663365] [2023-02-15 21:56:20,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:20,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:20,802 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 21:56:20,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:20,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191663365] [2023-02-15 21:56:20,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191663365] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:20,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:20,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:56:20,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925033924] [2023-02-15 21:56:20,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:20,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:56:20,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:20,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:56:20,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:56:20,806 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:20,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:20,858 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2023-02-15 21:56:20,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:56:20,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-15 21:56:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:20,859 INFO L225 Difference]: With dead ends: 55 [2023-02-15 21:56:20,860 INFO L226 Difference]: Without dead ends: 55 [2023-02-15 21:56:20,860 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 21:56:20,861 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:20,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:56:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-15 21:56:20,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2023-02-15 21:56:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.606060606060606) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 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 21:56:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2023-02-15 21:56:20,865 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 3 [2023-02-15 21:56:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:20,865 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2023-02-15 21:56:20,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2023-02-15 21:56:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 21:56:20,866 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:20,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:20,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 21:56:20,867 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:20,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:20,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1115897518, now seen corresponding path program 1 times [2023-02-15 21:56:20,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:20,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905172686] [2023-02-15 21:56:20,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:20,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:20,930 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 21:56:20,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:20,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905172686] [2023-02-15 21:56:20,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905172686] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:20,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:20,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:56:20,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261112558] [2023-02-15 21:56:20,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:20,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:56:20,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:20,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:56:20,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:56:20,933 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:20,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:20,990 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2023-02-15 21:56:20,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:56:20,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 21:56:20,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:20,991 INFO L225 Difference]: With dead ends: 58 [2023-02-15 21:56:20,992 INFO L226 Difference]: Without dead ends: 58 [2023-02-15 21:56:20,992 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 21:56:20,993 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:20,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 31 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:56:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-15 21:56:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2023-02-15 21:56:20,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 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 21:56:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2023-02-15 21:56:20,997 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 10 [2023-02-15 21:56:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:20,997 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2023-02-15 21:56:20,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2023-02-15 21:56:20,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 21:56:20,998 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:20,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:20,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 21:56:20,998 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:20,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:20,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1115897519, now seen corresponding path program 1 times [2023-02-15 21:56:20,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:20,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885117262] [2023-02-15 21:56:20,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:21,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:21,189 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 21:56:21,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:21,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885117262] [2023-02-15 21:56:21,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885117262] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:21,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:21,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:56:21,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901707837] [2023-02-15 21:56:21,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:21,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:56:21,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:21,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:56:21,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:56:21,199 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:21,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:21,270 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2023-02-15 21:56:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:56:21,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 21:56:21,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:21,271 INFO L225 Difference]: With dead ends: 87 [2023-02-15 21:56:21,271 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 21:56:21,272 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 21:56:21,272 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 48 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:21,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 53 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:56:21,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 21:56:21,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2023-02-15 21:56:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.528301886792453) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2023-02-15 21:56:21,277 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 10 [2023-02-15 21:56:21,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:21,277 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2023-02-15 21:56:21,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:21,278 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2023-02-15 21:56:21,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 21:56:21,278 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:21,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:21,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 21:56:21,278 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:21,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:21,279 INFO L85 PathProgramCache]: Analyzing trace with hash 233083786, now seen corresponding path program 1 times [2023-02-15 21:56:21,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:21,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137094154] [2023-02-15 21:56:21,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:21,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:21,311 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 21:56:21,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:21,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137094154] [2023-02-15 21:56:21,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137094154] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:21,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:21,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:56:21,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961446694] [2023-02-15 21:56:21,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:21,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:56:21,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:21,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:56:21,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:56:21,314 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 21:56:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:21,358 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2023-02-15 21:56:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:56:21,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 21:56:21,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:21,359 INFO L225 Difference]: With dead ends: 90 [2023-02-15 21:56:21,359 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 21:56:21,359 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 21:56:21,360 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 52 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:21,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 58 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:56:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 21:56:21,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2023-02-15 21:56:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.490566037735849) internal successors, (79), 66 states have internal predecessors, (79), 0 states have call successors, (0), 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 21:56:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2023-02-15 21:56:21,364 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 11 [2023-02-15 21:56:21,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:21,364 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2023-02-15 21:56:21,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 21:56:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2023-02-15 21:56:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 21:56:21,365 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:21,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:21,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 21:56:21,366 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:21,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:21,366 INFO L85 PathProgramCache]: Analyzing trace with hash 683852015, now seen corresponding path program 1 times [2023-02-15 21:56:21,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:21,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423042993] [2023-02-15 21:56:21,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:21,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:21,474 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 21:56:21,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:21,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423042993] [2023-02-15 21:56:21,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423042993] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:21,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:21,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:56:21,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858700671] [2023-02-15 21:56:21,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:21,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:56:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:21,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:56:21,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:56:21,477 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 21:56:21,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:21,510 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2023-02-15 21:56:21,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:56:21,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-02-15 21:56:21,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:21,511 INFO L225 Difference]: With dead ends: 66 [2023-02-15 21:56:21,511 INFO L226 Difference]: Without dead ends: 66 [2023-02-15 21:56:21,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:56:21,513 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:21,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 45 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:56:21,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-15 21:56:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-02-15 21:56:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.471698113207547) internal successors, (78), 65 states have internal predecessors, (78), 0 states have call successors, (0), 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 21:56:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2023-02-15 21:56:21,525 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 13 [2023-02-15 21:56:21,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:21,525 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2023-02-15 21:56:21,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 21:56:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2023-02-15 21:56:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 21:56:21,526 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:21,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:21,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 21:56:21,527 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:21,527 INFO L85 PathProgramCache]: Analyzing trace with hash -833158411, now seen corresponding path program 1 times [2023-02-15 21:56:21,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:21,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941607186] [2023-02-15 21:56:21,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:21,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:21,778 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 21:56:21,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:21,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941607186] [2023-02-15 21:56:21,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941607186] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:21,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:21,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:56:21,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088416967] [2023-02-15 21:56:21,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:21,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:56:21,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:21,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:56:21,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:56:21,780 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:21,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:21,873 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2023-02-15 21:56:21,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:56:21,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 21:56:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:21,876 INFO L225 Difference]: With dead ends: 73 [2023-02-15 21:56:21,876 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 21:56:21,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:56:21,878 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 58 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:21,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 84 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:56:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 21:56:21,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2023-02-15 21:56:21,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.4375) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 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 21:56:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2023-02-15 21:56:21,890 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 15 [2023-02-15 21:56:21,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:21,890 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2023-02-15 21:56:21,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:21,891 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2023-02-15 21:56:21,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 21:56:21,891 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:21,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:21,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 21:56:21,892 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:21,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:21,892 INFO L85 PathProgramCache]: Analyzing trace with hash -833147426, now seen corresponding path program 1 times [2023-02-15 21:56:21,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:21,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692769283] [2023-02-15 21:56:21,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:21,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:21,948 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 21:56:21,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:21,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692769283] [2023-02-15 21:56:21,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692769283] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:21,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:21,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:56:21,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992738653] [2023-02-15 21:56:21,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:21,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:56:21,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:21,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:56:21,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:56:21,951 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:22,004 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2023-02-15 21:56:22,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:56:22,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 21:56:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:22,005 INFO L225 Difference]: With dead ends: 77 [2023-02-15 21:56:22,005 INFO L226 Difference]: Without dead ends: 77 [2023-02-15 21:56:22,005 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 21:56:22,006 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 44 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:22,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 60 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:56:22,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-15 21:56:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2023-02-15 21:56:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 69 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2023-02-15 21:56:22,010 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 15 [2023-02-15 21:56:22,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:22,010 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2023-02-15 21:56:22,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2023-02-15 21:56:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 21:56:22,011 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:22,011 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 21:56:22,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 21:56:22,011 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:22,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:22,012 INFO L85 PathProgramCache]: Analyzing trace with hash 321145941, now seen corresponding path program 1 times [2023-02-15 21:56:22,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:22,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76797926] [2023-02-15 21:56:22,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:22,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:22,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:22,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76797926] [2023-02-15 21:56:22,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76797926] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:56:22,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145709320] [2023-02-15 21:56:22,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:22,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:56:22,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:56:22,144 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 21:56:22,161 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 21:56:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:22,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 21:56:22,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:56:22,271 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 21:56:22,275 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 21:56:22,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:22,311 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 21:56:22,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:22,317 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 21:56:22,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:22,337 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 21:56:22,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:22,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 21:56:22,401 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:22,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 21:56:22,410 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:22,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:22,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2023-02-15 21:56:22,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:22,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:56:22,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 21:56:22,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-02-15 21:56:22,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 21:56:22,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:22,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145709320] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:56:22,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:56:22,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2023-02-15 21:56:22,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795529336] [2023-02-15 21:56:22,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:56:22,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 21:56:22,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:22,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 21:56:22,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:56:22,717 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:22,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:22,962 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2023-02-15 21:56:22,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 21:56:22,963 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 21:56:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:22,964 INFO L225 Difference]: With dead ends: 85 [2023-02-15 21:56:22,964 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 21:56:22,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2023-02-15 21:56:22,965 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 107 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:22,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 203 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:56:22,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 21:56:22,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2023-02-15 21:56:22,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 80 states have internal predecessors, (97), 0 states have call successors, (0), 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 21:56:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2023-02-15 21:56:22,967 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 18 [2023-02-15 21:56:22,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:22,967 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2023-02-15 21:56:22,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:22,968 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2023-02-15 21:56:22,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 21:56:22,968 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:22,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:22,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 21:56:23,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:56:23,169 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:23,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:23,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1365588675, now seen corresponding path program 1 times [2023-02-15 21:56:23,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:23,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206368805] [2023-02-15 21:56:23,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:23,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:23,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:23,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206368805] [2023-02-15 21:56:23,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206368805] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:56:23,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900106207] [2023-02-15 21:56:23,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:23,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:56:23,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:56:23,284 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 21:56:23,301 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 21:56:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:23,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 21:56:23,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:56:23,404 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 0 case distinctions, treesize of input 15 treesize of output 14 [2023-02-15 21:56:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:23,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:56:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:23,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900106207] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:56:23,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:56:23,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-15 21:56:23,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384465758] [2023-02-15 21:56:23,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:56:23,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:56:23,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:23,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:56:23,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:56:23,479 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.6) 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 21:56:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:23,543 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2023-02-15 21:56:23,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:56:23,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 19 [2023-02-15 21:56:23,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:23,546 INFO L225 Difference]: With dead ends: 83 [2023-02-15 21:56:23,546 INFO L226 Difference]: Without dead ends: 72 [2023-02-15 21:56:23,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:56:23,547 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:23,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 88 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:56:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-15 21:56:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-02-15 21:56:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 71 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 21:56:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2023-02-15 21:56:23,551 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 19 [2023-02-15 21:56:23,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:23,551 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2023-02-15 21:56:23,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 21:56:23,551 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2023-02-15 21:56:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 21:56:23,552 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:23,552 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:23,559 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 21:56:23,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 21:56:23,758 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:23,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash -190050214, now seen corresponding path program 1 times [2023-02-15 21:56:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:23,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905038113] [2023-02-15 21:56:23,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:23,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:23,842 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 21:56:23,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:23,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905038113] [2023-02-15 21:56:23,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905038113] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:23,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:23,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:56:23,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906480952] [2023-02-15 21:56:23,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:23,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:56:23,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:23,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:56:23,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:56:23,844 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 21:56:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:23,890 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2023-02-15 21:56:23,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:56:23,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2023-02-15 21:56:23,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:23,891 INFO L225 Difference]: With dead ends: 81 [2023-02-15 21:56:23,891 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 21:56:23,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:56:23,891 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 74 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:23,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 51 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:56:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 21:56:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2023-02-15 21:56:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 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 21:56:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2023-02-15 21:56:23,893 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 19 [2023-02-15 21:56:23,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:23,894 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2023-02-15 21:56:23,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 21:56:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2023-02-15 21:56:23,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 21:56:23,897 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:23,898 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] [2023-02-15 21:56:23,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 21:56:23,898 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:23,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:23,898 INFO L85 PathProgramCache]: Analyzing trace with hash -36338646, now seen corresponding path program 1 times [2023-02-15 21:56:23,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:23,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093439421] [2023-02-15 21:56:23,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:23,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:24,102 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 21:56:24,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:24,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093439421] [2023-02-15 21:56:24,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093439421] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:24,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:24,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:56:24,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142847488] [2023-02-15 21:56:24,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:24,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 21:56:24,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:24,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 21:56:24,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:56:24,104 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:24,211 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2023-02-15 21:56:24,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 21:56:24,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-15 21:56:24,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:24,212 INFO L225 Difference]: With dead ends: 87 [2023-02-15 21:56:24,212 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 21:56:24,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-02-15 21:56:24,213 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 53 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:24,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 158 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:56:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 21:56:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 68. [2023-02-15 21:56:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.375) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2023-02-15 21:56:24,217 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2023-02-15 21:56:24,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:24,217 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2023-02-15 21:56:24,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2023-02-15 21:56:24,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 21:56:24,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:24,219 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] [2023-02-15 21:56:24,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 21:56:24,219 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:24,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:24,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1126497925, now seen corresponding path program 1 times [2023-02-15 21:56:24,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:24,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802250561] [2023-02-15 21:56:24,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:24,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:24,432 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 21:56:24,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:24,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802250561] [2023-02-15 21:56:24,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802250561] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:24,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:24,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:56:24,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091844331] [2023-02-15 21:56:24,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:24,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 21:56:24,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:24,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 21:56:24,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:56:24,435 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 21:56:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:24,581 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2023-02-15 21:56:24,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 21:56:24,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-02-15 21:56:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:24,582 INFO L225 Difference]: With dead ends: 86 [2023-02-15 21:56:24,582 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 21:56:24,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-02-15 21:56:24,583 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 47 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:24,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 131 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:56:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 21:56:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2023-02-15 21:56:24,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2023-02-15 21:56:24,586 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 25 [2023-02-15 21:56:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:24,586 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2023-02-15 21:56:24,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 21:56:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2023-02-15 21:56:24,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 21:56:24,588 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:24,588 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 21:56:24,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 21:56:24,588 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:24,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:24,589 INFO L85 PathProgramCache]: Analyzing trace with hash -561697204, now seen corresponding path program 1 times [2023-02-15 21:56:24,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:24,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011897250] [2023-02-15 21:56:24,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:24,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:24,777 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 21:56:24,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:24,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011897250] [2023-02-15 21:56:24,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011897250] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:24,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:24,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:56:24,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164729484] [2023-02-15 21:56:24,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:24,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 21:56:24,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:24,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 21:56:24,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:56:24,780 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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 21:56:24,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:24,886 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2023-02-15 21:56:24,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:56:24,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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 21:56:24,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:24,888 INFO L225 Difference]: With dead ends: 69 [2023-02-15 21:56:24,888 INFO L226 Difference]: Without dead ends: 69 [2023-02-15 21:56:24,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:56:24,889 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:24,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 77 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:56:24,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-15 21:56:24,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-02-15 21:56:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 67 states have internal predecessors, (75), 0 states have call successors, (0), 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 21:56:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2023-02-15 21:56:24,890 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 26 [2023-02-15 21:56:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:24,891 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2023-02-15 21:56:24,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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 21:56:24,891 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2023-02-15 21:56:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 21:56:24,893 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:24,893 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] [2023-02-15 21:56:24,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 21:56:24,893 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:24,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1337846250, now seen corresponding path program 1 times [2023-02-15 21:56:24,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:24,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264523871] [2023-02-15 21:56:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:24,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:25,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:25,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264523871] [2023-02-15 21:56:25,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264523871] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:56:25,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593477798] [2023-02-15 21:56:25,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:25,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:56:25,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:56:25,076 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 21:56:25,078 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 21:56:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:25,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 21:56:25,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:56:25,163 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 21:56:25,177 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 21:56:25,177 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 21:56:25,190 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 21:56:25,214 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:56:25,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 21:56:25,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:25,241 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 31 treesize of output 26 [2023-02-15 21:56:25,287 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:25,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:25,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2023-02-15 21:56:25,314 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 12 treesize of output 14 [2023-02-15 21:56:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:25,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:56:25,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:25,550 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 49 treesize of output 53 [2023-02-15 21:56:25,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:25,638 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 18 treesize of output 19 [2023-02-15 21:56:25,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:25,644 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 30 treesize of output 30 [2023-02-15 21:56:25,648 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 9 treesize of output 7 [2023-02-15 21:56:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:25,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593477798] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:56:25,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:56:25,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 22 [2023-02-15 21:56:25,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597270179] [2023-02-15 21:56:25,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:56:25,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 21:56:25,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:25,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 21:56:25,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=441, Unknown=1, NotChecked=0, Total=506 [2023-02-15 21:56:25,710 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 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 21:56:26,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:26,369 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2023-02-15 21:56:26,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 21:56:26,370 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 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 21:56:26,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:26,370 INFO L225 Difference]: With dead ends: 95 [2023-02-15 21:56:26,370 INFO L226 Difference]: Without dead ends: 95 [2023-02-15 21:56:26,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=942, Unknown=1, NotChecked=0, Total=1190 [2023-02-15 21:56:26,371 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 207 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:26,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 176 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 21:56:26,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-02-15 21:56:26,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 73. [2023-02-15 21:56:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.360655737704918) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 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 21:56:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2023-02-15 21:56:26,373 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 26 [2023-02-15 21:56:26,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:26,373 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2023-02-15 21:56:26,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 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 21:56:26,373 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2023-02-15 21:56:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 21:56:26,373 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:26,373 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] [2023-02-15 21:56:26,380 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 21:56:26,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:56:26,574 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:26,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1337846251, now seen corresponding path program 1 times [2023-02-15 21:56:26,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:26,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075540248] [2023-02-15 21:56:26,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:26,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:26,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:26,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075540248] [2023-02-15 21:56:26,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075540248] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:56:26,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196380948] [2023-02-15 21:56:26,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:26,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:56:26,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:56:26,847 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 21:56:26,876 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 21:56:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:26,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 21:56:26,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:56:26,935 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 21:56:26,970 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 21:56:26,972 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 21:56:27,005 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 21:56:27,009 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 21:56:27,036 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:56:27,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-15 21:56:27,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 21:56:27,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:27,071 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 31 treesize of output 26 [2023-02-15 21:56:27,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:27,076 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 21:56:27,115 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:27,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 21:56:27,118 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:27,119 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:27,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2023-02-15 21:56:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:27,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:56:27,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:27,422 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 59 treesize of output 63 [2023-02-15 21:56:27,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:27,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2023-02-15 21:56:27,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:27,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2023-02-15 21:56:27,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-02-15 21:56:27,570 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:27,571 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 18 treesize of output 1 [2023-02-15 21:56:27,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:27,576 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 18 treesize of output 19 [2023-02-15 21:56:27,577 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:27,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:27,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 21:56:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:27,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196380948] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:56:27,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:56:27,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2023-02-15 21:56:27,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695133395] [2023-02-15 21:56:27,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:56:27,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 21:56:27,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:27,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 21:56:27,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=623, Unknown=1, NotChecked=0, Total=702 [2023-02-15 21:56:27,717 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 27 states, 26 states have (on average 2.923076923076923) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:28,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:28,481 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2023-02-15 21:56:28,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 21:56:28,482 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.923076923076923) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 21:56:28,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:28,483 INFO L225 Difference]: With dead ends: 111 [2023-02-15 21:56:28,483 INFO L226 Difference]: Without dead ends: 111 [2023-02-15 21:56:28,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=307, Invalid=1252, Unknown=1, NotChecked=0, Total=1560 [2023-02-15 21:56:28,484 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 307 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:28,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 195 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 21:56:28,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-15 21:56:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 85. [2023-02-15 21:56:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 84 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2023-02-15 21:56:28,486 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 26 [2023-02-15 21:56:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:28,486 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2023-02-15 21:56:28,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.923076923076923) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2023-02-15 21:56:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 21:56:28,487 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:28,487 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 21:56:28,505 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 21:56:28,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-15 21:56:28,706 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:28,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:28,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1476440114, now seen corresponding path program 1 times [2023-02-15 21:56:28,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:28,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591123578] [2023-02-15 21:56:28,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:28,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:28,826 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 21:56:28,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:28,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591123578] [2023-02-15 21:56:28,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591123578] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:56:28,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124403096] [2023-02-15 21:56:28,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:28,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:56:28,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:56:28,839 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 21:56:28,893 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 21:56:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:28,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-15 21:56:28,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:56:28,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 21:56:29,049 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 21:56:29,049 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 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 21:56:29,063 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 21:56:29,092 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:56:29,093 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 27 treesize of output 28 [2023-02-15 21:56:29,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:29,118 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 30 treesize of output 25 [2023-02-15 21:56:29,147 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:29,148 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:29,149 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 24 treesize of output 15 [2023-02-15 21:56:29,156 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 21:56:29,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:56:29,244 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_28| Int) (v_ArrVal_676 (Array Int Int))) (or (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_676) |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_28|))) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_28| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_28|)))) is different from false [2023-02-15 21:56:29,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:29,250 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 21:56:29,262 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:29,263 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 33 treesize of output 33 [2023-02-15 21:56:29,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-02-15 21:56:29,361 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 21:56:29,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124403096] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:56:29,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:56:29,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2023-02-15 21:56:29,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622319352] [2023-02-15 21:56:29,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:56:29,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 21:56:29,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:29,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 21:56:29,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=323, Unknown=1, NotChecked=36, Total=420 [2023-02-15 21:56:29,363 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 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 21:56:29,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:29,800 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2023-02-15 21:56:29,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 21:56:29,800 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 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 21:56:29,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:29,801 INFO L225 Difference]: With dead ends: 110 [2023-02-15 21:56:29,801 INFO L226 Difference]: Without dead ends: 110 [2023-02-15 21:56:29,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=795, Unknown=1, NotChecked=62, Total=1122 [2023-02-15 21:56:29,802 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 138 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:29,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 186 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 392 Invalid, 2 Unknown, 58 Unchecked, 0.2s Time] [2023-02-15 21:56:29,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-15 21:56:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 85. [2023-02-15 21:56:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.356164383561644) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:56:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2023-02-15 21:56:29,803 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 27 [2023-02-15 21:56:29,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:29,804 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2023-02-15 21:56:29,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 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 21:56:29,804 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2023-02-15 21:56:29,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 21:56:29,804 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:29,804 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:56:29,811 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 21:56:30,009 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,SelfDestructingSolverStorable16 [2023-02-15 21:56:30,009 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:30,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:30,009 INFO L85 PathProgramCache]: Analyzing trace with hash -328711838, now seen corresponding path program 1 times [2023-02-15 21:56:30,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:30,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602623612] [2023-02-15 21:56:30,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:30,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:30,199 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 21:56:30,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:30,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602623612] [2023-02-15 21:56:30,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602623612] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:56:30,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:56:30,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 21:56:30,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692449494] [2023-02-15 21:56:30,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:56:30,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 21:56:30,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:30,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 21:56:30,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:56:30,201 INFO L87 Difference]: Start difference. First operand 85 states and 99 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 21:56:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:30,405 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2023-02-15 21:56:30,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 21:56:30,406 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 21:56:30,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:30,406 INFO L225 Difference]: With dead ends: 98 [2023-02-15 21:56:30,406 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 21:56:30,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2023-02-15 21:56:30,407 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 64 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:30,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 97 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:56:30,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 21:56:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2023-02-15 21:56:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 84 states have internal predecessors, (98), 0 states have call successors, (0), 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 21:56:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2023-02-15 21:56:30,409 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 29 [2023-02-15 21:56:30,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:30,409 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2023-02-15 21:56:30,409 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 21:56:30,409 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2023-02-15 21:56:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 21:56:30,409 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:30,409 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] [2023-02-15 21:56:30,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 21:56:30,410 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:30,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:30,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1935506277, now seen corresponding path program 1 times [2023-02-15 21:56:30,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:30,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549898340] [2023-02-15 21:56:30,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:30,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:30,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:30,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549898340] [2023-02-15 21:56:30,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549898340] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:56:30,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80777142] [2023-02-15 21:56:30,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:30,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:56:30,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:56:30,797 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 21:56:30,798 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 21:56:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:30,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 21:56:30,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:56:30,882 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 21:56:30,900 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 21:56:30,900 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 21:56:30,907 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 21:56:30,918 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:56:30,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 21:56:30,940 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 21:56:30,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-15 21:56:30,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:30,948 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 39 treesize of output 30 [2023-02-15 21:56:31,072 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:31,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:31,085 INFO L321 Elim1Store]: treesize reduction 10, result has 68.8 percent of original size [2023-02-15 21:56:31,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 41 [2023-02-15 21:56:31,146 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:56:31,146 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 12 treesize of output 18 [2023-02-15 21:56:31,175 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 12 treesize of output 14 [2023-02-15 21:56:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:31,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:56:31,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:31,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 229 treesize of output 293 [2023-02-15 21:56:32,409 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse6 (forall ((v_ArrVal_813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))))))) (and (forall ((v_prenex_6 Int) (v_prenex_7 Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (v_prenex_5 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_6) (forall ((v_ArrVal_813 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_6) v_prenex_7) |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))) (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int))) (let ((.cse2 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_6))) (let ((.cse1 (select .cse2 v_prenex_7))) (or (not (= .cse1 (select .cse2 8))) (not (<= v_prenex_7 |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 v_prenex_7)) (= .cse1 v_prenex_6))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6))) (forall ((v_prenex_6 Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int))) (let ((.cse3 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_6) v_prenex_7))) (or (forall ((v_ArrVal_813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))) (= .cse3 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))) (= .cse3 v_prenex_6)))))) (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int))) (let ((.cse4 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_6) v_prenex_7))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_6) (forall ((v_ArrVal_813 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))))) (= .cse4 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))) (= .cse4 v_prenex_6)))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6))) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 (Array Int Int))) (or (not (<= v_prenex_7 |c_ULTIMATE.start_main_~y~0#1.offset|)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~list~0#1.base|) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6) (not (<= 0 v_prenex_7)))) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 (Array Int Int))) (let ((.cse5 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_6) v_prenex_7))) (or (forall ((v_ArrVal_813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_6) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))) (= .cse5 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))) (= .cse5 |c_ULTIMATE.start_main_~list~0#1.base|)))) (or .cse6 (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 (Array Int Int))) (let ((.cse7 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_6) v_prenex_7))) (or (= .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6) (= .cse7 v_prenex_6))))) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 (Array Int Int))) (let ((.cse8 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_6) v_prenex_7))) (or (= .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_6) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))))) (= .cse8 v_prenex_6)))) (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int))) (let ((.cse9 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_6) v_prenex_7))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_6) (forall ((v_ArrVal_813 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))))) (= .cse9 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))) (= .cse9 |c_ULTIMATE.start_main_~list~0#1.base|) (= .cse9 v_prenex_6)))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6))) (forall ((v_prenex_6 Int)) (or (forall ((v_ArrVal_813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_6) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6) (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int))) (let ((.cse10 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_6) v_prenex_7))) (or (= .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) (= .cse10 v_prenex_6)))))) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 (Array Int Int))) (let ((.cse11 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_6) v_prenex_7))) (or (forall ((v_ArrVal_813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))) (= .cse11 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))) (= .cse11 |c_ULTIMATE.start_main_~list~0#1.base|) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6)))) (or .cse6 (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~list~0#1.base|) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6)))) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 (Array Int Int))) (or (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~list~0#1.base|) (forall ((v_ArrVal_813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_6) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6))) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 (Array Int Int))) (let ((.cse12 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_6) v_prenex_7))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_6) (forall ((v_ArrVal_813 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))))) (= .cse12 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))) (= .cse12 v_prenex_6)))) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 (Array Int Int))) (let ((.cse13 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_6) v_prenex_7))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_11| v_prenex_6) (forall ((v_ArrVal_813 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))))) (= .cse13 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))) (= .cse13 |c_ULTIMATE.start_main_~list~0#1.base|) (= .cse13 v_prenex_6)))) (forall ((v_prenex_6 Int)) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int))) (let ((.cse14 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_prenex_6) v_prenex_7))) (or (forall ((v_ArrVal_813 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc8#1.base_11| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_32| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_32| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_32|)) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) |v_ULTIMATE.start_main_~list~0#1.offset_32|))) (= .cse14 |v_ULTIMATE.start_main_#t~malloc8#1.base_11|))) (= .cse14 |c_ULTIMATE.start_main_~list~0#1.base|) (= .cse14 v_prenex_6)))) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_6)))))) is different from false [2023-02-15 21:56:32,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:32,559 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 1 case distinctions, treesize of input 68 treesize of output 52 [2023-02-15 21:56:32,575 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 90 treesize of output 82 [2023-02-15 21:56:32,578 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:32,589 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:32,589 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 69 treesize of output 83 [2023-02-15 21:56:32,593 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:32,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:32,597 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 62 treesize of output 62 [2023-02-15 21:56:32,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:32,658 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 1 case distinctions, treesize of input 71 treesize of output 55 [2023-02-15 21:56:32,662 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 105 treesize of output 97 [2023-02-15 21:56:32,665 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:32,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:32,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:32,672 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 84 [2023-02-15 21:56:32,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-02-15 21:56:32,684 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:32,685 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 21:56:32,695 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:32,695 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 1 case distinctions, treesize of input 71 treesize of output 1 [2023-02-15 21:56:32,701 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:32,701 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 1 case distinctions, treesize of input 94 treesize of output 1 [2023-02-15 21:56:32,706 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:32,706 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 1 case distinctions, treesize of input 71 treesize of output 1 [2023-02-15 21:56:32,710 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:32,711 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 1 case distinctions, treesize of input 71 treesize of output 1 [2023-02-15 21:56:32,716 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:32,717 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 1 case distinctions, treesize of input 94 treesize of output 1 [2023-02-15 21:56:32,721 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:32,721 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 1 case distinctions, treesize of input 48 treesize of output 1 [2023-02-15 21:56:32,725 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:32,725 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 1 case distinctions, treesize of input 23 treesize of output 1 [2023-02-15 21:56:32,730 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:32,730 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 1 case distinctions, treesize of input 71 treesize of output 1 [2023-02-15 21:56:32,735 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:32,735 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 1 case distinctions, treesize of input 71 treesize of output 1 [2023-02-15 21:56:32,740 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:32,741 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 1 case distinctions, treesize of input 71 treesize of output 1 [2023-02-15 21:56:32,746 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:32,746 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 1 case distinctions, treesize of input 71 treesize of output 1 [2023-02-15 21:56:32,752 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:32,752 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 1 case distinctions, treesize of input 94 treesize of output 1 [2023-02-15 21:56:32,757 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:32,757 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 1 case distinctions, treesize of input 48 treesize of output 1 [2023-02-15 21:56:32,762 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:56:32,762 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 1 case distinctions, treesize of input 48 treesize of output 1 [2023-02-15 21:56:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:32,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80777142] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:56:32,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:56:32,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17] total 37 [2023-02-15 21:56:32,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722447352] [2023-02-15 21:56:32,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:56:32,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 21:56:32,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:56:32,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 21:56:32,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1173, Unknown=1, NotChecked=70, Total=1406 [2023-02-15 21:56:32,819 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 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 21:56:45,909 WARN L233 SmtUtils]: Spent 12.84s on a formula simplification. DAG size of input: 116 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 21:56:48,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 21:56:51,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:56:51,574 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2023-02-15 21:56:51,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 21:56:51,574 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 21:56:51,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:56:51,575 INFO L225 Difference]: With dead ends: 96 [2023-02-15 21:56:51,575 INFO L226 Difference]: Without dead ends: 96 [2023-02-15 21:56:51,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=690, Invalid=2971, Unknown=3, NotChecked=118, Total=3782 [2023-02-15 21:56:51,577 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 231 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 78 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-15 21:56:51,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 240 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 631 Invalid, 6 Unknown, 60 Unchecked, 2.6s Time] [2023-02-15 21:56:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-15 21:56:51,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2023-02-15 21:56:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 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 21:56:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2023-02-15 21:56:51,583 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 31 [2023-02-15 21:56:51,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:56:51,583 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2023-02-15 21:56:51,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 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 21:56:51,583 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2023-02-15 21:56:51,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 21:56:51,584 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:56:51,584 INFO L195 NwaCegarLoop]: trace histogram [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 21:56:51,598 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 21:56:51,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:56:51,799 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 21:56:51,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:56:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash 678559033, now seen corresponding path program 1 times [2023-02-15 21:56:51,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:56:51,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204413980] [2023-02-15 21:56:51,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:51,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:56:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:52,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:56:52,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204413980] [2023-02-15 21:56:52,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204413980] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:56:52,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935926838] [2023-02-15 21:56:52,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:56:52,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 21:56:52,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:56:52,445 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 21:56:52,489 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 21:56:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:56:52,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-15 21:56:52,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:56:52,603 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 21:56:52,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:56:52,618 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 15 treesize of output 11 [2023-02-15 21:56:52,656 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 21:56:52,657 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 21:56:52,693 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 21:56:52,698 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 21:56:52,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:56:52,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 50 [2023-02-15 21:56:52,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2023-02-15 21:56:52,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:52,796 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:52,802 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 21:56:52,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2023-02-15 21:56:52,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:52,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 21:56:53,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:53,202 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:53,204 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:53,208 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 21:56:53,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 16 [2023-02-15 21:56:53,212 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:56:53,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:56:53,227 INFO L321 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2023-02-15 21:56:53,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 28 [2023-02-15 21:56:53,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:56:53,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:57:19,684 INFO L321 Elim1Store]: treesize reduction 48, result has 46.1 percent of original size [2023-02-15 21:57:19,684 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 3 case distinctions, treesize of input 402 treesize of output 377 [2023-02-15 21:57:19,790 INFO L321 Elim1Store]: treesize reduction 204, result has 32.9 percent of original size [2023-02-15 21:57:19,790 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 8994 treesize of output 1962 [2023-02-15 21:57:19,831 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 21:57:19,831 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 2001 treesize of output 1871 [2023-02-15 21:57:19,875 INFO L321 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2023-02-15 21:57:19,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1880 treesize of output 1676 [2023-02-15 21:57:19,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:57:19,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:57:19,899 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 21:57:19,899 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1468 treesize of output 1332 [2023-02-15 21:57:19,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2023-02-15 21:58:47,460 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:58:47,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:58:47,566 INFO L321 Elim1Store]: treesize reduction 28, result has 50.9 percent of original size [2023-02-15 21:58:47,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 1095 treesize of output 757 [2023-02-15 21:58:47,829 INFO L321 Elim1Store]: treesize reduction 1271, result has 0.1 percent of original size [2023-02-15 21:58:47,830 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 12914 treesize of output 1 [2023-02-15 21:58:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:58:48,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935926838] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:58:48,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 21:58:48,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 34 [2023-02-15 21:58:48,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609984817] [2023-02-15 21:58:48,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 21:58:48,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 21:58:48,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:58:48,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 21:58:48,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=995, Unknown=5, NotChecked=0, Total=1122 [2023-02-15 21:58:48,153 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 34 states, 34 states have (on average 2.411764705882353) internal successors, (82), 34 states have internal predecessors, (82), 0 states have call successors, (0), 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 21:58:56,061 WARN L233 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 87 DAG size of output: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 21:58:58,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 21:59:09,760 WARN L233 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 21:59:23,447 WARN L233 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 21:59:25,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 21:59:30,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 21:59:37,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 21:59:40,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 21:59:43,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 21:59:48,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 21:59:52,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 21:59:57,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 21:59:59,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 22:00:00,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:00,170 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2023-02-15 22:00:00,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 22:00:00,171 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.411764705882353) internal successors, (82), 34 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 22:00:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:00,171 INFO L225 Difference]: With dead ends: 145 [2023-02-15 22:00:00,171 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 22:00:00,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 72.8s TimeCoverageRelationStatistics Valid=597, Invalid=2933, Unknown=10, NotChecked=0, Total=3540 [2023-02-15 22:00:00,172 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 320 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 82 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:00,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 336 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 788 Invalid, 9 Unknown, 0 Unchecked, 26.0s Time] [2023-02-15 22:00:00,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 22:00:00,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 113. [2023-02-15 22:00:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.2673267326732673) internal successors, (128), 112 states have internal predecessors, (128), 0 states have call successors, (0), 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 22:00:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2023-02-15 22:00:00,174 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 31 [2023-02-15 22:00:00,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:00,175 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2023-02-15 22:00:00,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.411764705882353) internal successors, (82), 34 states have internal predecessors, (82), 0 states have call successors, (0), 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 22:00:00,175 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2023-02-15 22:00:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 22:00:00,175 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:00,175 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:00,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 22:00:00,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:00:00,376 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:00:00,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:00,376 INFO L85 PathProgramCache]: Analyzing trace with hash 678570018, now seen corresponding path program 1 times [2023-02-15 22:00:00,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:00:00,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314443267] [2023-02-15 22:00:00,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:00,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:00:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:00,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:00,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:00:00,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314443267] [2023-02-15 22:00:00,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314443267] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:00:00,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920086754] [2023-02-15 22:00:00,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:00,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:00:00,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:00:00,562 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 22:00:00,564 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 22:00:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:00,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 22:00:00,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:00,667 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 22:00:00,701 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:00:00,702 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 22:00:00,726 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 22:00:00,750 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 22:00:00,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:00,807 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 49 treesize of output 40 [2023-02-15 22:00:00,884 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:00,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:00,887 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 43 treesize of output 30 [2023-02-15 22:00:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:00,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:00:01,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:01,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-02-15 22:00:01,128 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:01,128 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 30 treesize of output 30 [2023-02-15 22:00:01,132 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 9 treesize of output 7 [2023-02-15 22:00:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:01,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920086754] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:00:01,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:00:01,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2023-02-15 22:00:01,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312674352] [2023-02-15 22:00:01,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:00:01,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 22:00:01,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:00:01,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 22:00:01,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=358, Unknown=1, NotChecked=0, Total=420 [2023-02-15 22:00:01,275 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 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 22:00:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:02,222 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2023-02-15 22:00:02,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 22:00:02,223 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 22:00:02,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:02,223 INFO L225 Difference]: With dead ends: 134 [2023-02-15 22:00:02,223 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 22:00:02,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=813, Unknown=1, NotChecked=0, Total=1056 [2023-02-15 22:00:02,224 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 155 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 33 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:02,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 194 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 455 Invalid, 5 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:00:02,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 22:00:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 115. [2023-02-15 22:00:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 103 states have (on average 1.2621359223300972) internal successors, (130), 114 states have internal predecessors, (130), 0 states have call successors, (0), 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 22:00:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 130 transitions. [2023-02-15 22:00:02,226 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 130 transitions. Word has length 31 [2023-02-15 22:00:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:02,226 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 130 transitions. [2023-02-15 22:00:02,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 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 22:00:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 130 transitions. [2023-02-15 22:00:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 22:00:02,226 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:02,226 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] [2023-02-15 22:00:02,245 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 22:00:02,432 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,SelfDestructingSolverStorable20 [2023-02-15 22:00:02,432 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-15 22:00:02,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:02,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1131545711, now seen corresponding path program 2 times [2023-02-15 22:00:02,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:00:02,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353518025] [2023-02-15 22:00:02,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:02,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:00:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:02,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:00:02,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353518025] [2023-02-15 22:00:02,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353518025] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:00:02,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715528881] [2023-02-15 22:00:02,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:00:02,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:00:02,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:00:02,932 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 22:00:02,977 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 22:00:03,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:00:03,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:00:03,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-15 22:00:03,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:03,071 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 22:00:03,095 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 22:00:03,100 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 22:00:03,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:03,112 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 22:00:03,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:03,120 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 22:00:03,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:03,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:03,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-15 22:00:03,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:03,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:03,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-15 22:00:03,221 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:00:03,222 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 22:00:03,267 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 21 [2023-02-15 22:00:03,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 22:00:03,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:03,338 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-02-15 22:00:03,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 75 [2023-02-15 22:00:03,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:03,355 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-02-15 22:00:03,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 42 [2023-02-15 22:00:03,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:03,435 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:00:03,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 48 [2023-02-15 22:00:03,441 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 29 treesize of output 25 [2023-02-15 22:00:03,739 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:03,757 INFO L321 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2023-02-15 22:00:03,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 49 [2023-02-15 22:00:03,771 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:03,771 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 22 treesize of output 26 [2023-02-15 22:00:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:03,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:00:12,293 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_49| Int) (v_ArrVal_1110 Int) (v_ArrVal_1109 Int)) (or (forall ((v_subst_1 Int)) (or (not (<= 0 v_subst_1)) (= (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse4 .cse5 v_ArrVal_1109)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_ArrVal_1110))) (select (store .cse0 |c_ULTIMATE.start_main_~y~0#1.base| .cse1) (select .cse1 |v_ULTIMATE.start_main_~list~0#1.offset_49|)))) v_subst_1) 0) (< 0 v_subst_1))) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_49|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_49| |c_ULTIMATE.start_main_~y~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_49| Int) (v_ArrVal_1110 Int) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1111 (Array Int Int)) (v_ArrVal_1109 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_49|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_49| |c_ULTIMATE.start_main_~y~0#1.offset|)) (forall ((v_subst_2 Int)) (or (= (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_1104))) (store .cse6 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse5 |c_ULTIMATE.start_main_~y~0#1.offset|))) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_1111) (select (store (select (store .cse3 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse4 .cse5 v_ArrVal_1109)) |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_ArrVal_1110) |v_ULTIMATE.start_main_~list~0#1.offset_49|)) v_subst_2) 0) (not (<= 0 v_subst_2)) (< 0 v_subst_2)))))))) is different from false [2023-02-15 22:00:43,988 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:44,109 INFO L321 Elim1Store]: treesize reduction 120, result has 43.7 percent of original size [2023-02-15 22:00:44,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 167 treesize of output 162 [2023-02-15 22:00:44,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:44,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62 [2023-02-15 22:00:44,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:44,146 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 737 treesize of output 717 [2023-02-15 22:00:44,162 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:44,162 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 785 treesize of output 695 [2023-02-15 22:00:44,174 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 600 treesize of output 576 [2023-02-15 22:00:44,189 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 608 treesize of output 594 [2023-02-15 22:00:44,237 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 31 treesize of output 25 [2023-02-15 22:00:44,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:44,332 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 178 treesize of output 172 [2023-02-15 22:00:44,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:44,370 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 428 treesize of output 434 [2023-02-15 22:00:44,618 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:44,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:44,655 INFO L321 Elim1Store]: treesize reduction 8, result has 70.4 percent of original size [2023-02-15 22:00:44,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 102 [2023-02-15 22:00:44,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:44,784 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:44,785 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:44,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:44,917 INFO L321 Elim1Store]: treesize reduction 231, result has 25.7 percent of original size [2023-02-15 22:00:44,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30100 treesize of output 4862 [2023-02-15 22:00:45,011 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:45,024 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-02-15 22:00:45,025 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 4974 treesize of output 4370 [2023-02-15 22:00:45,057 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:45,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:45,061 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 3596 treesize of output 3122 [2023-02-15 22:00:45,123 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:45,170 INFO L321 Elim1Store]: treesize reduction 18, result has 68.4 percent of original size [2023-02-15 22:00:45,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 2307 treesize of output 2077 [2023-02-15 22:00:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:52,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715528881] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:00:52,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:00:52,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 18] total 41 [2023-02-15 22:00:52,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143566175] [2023-02-15 22:00:52,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:00:52,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 22:00:52,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:00:52,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 22:00:52,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1420, Unknown=17, NotChecked=76, Total=1640 [2023-02-15 22:00:52,180 INFO L87 Difference]: Start difference. First operand 115 states and 130 transitions. Second operand has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)