./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 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-ext3/getNumbers4-2.c -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 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:34:07,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:34:07,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:34:07,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:34:07,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:34:07,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:34:07,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:34:07,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:34:07,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:34:07,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:34:07,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:34:07,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:34:07,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:34:07,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:34:07,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:34:07,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:34:07,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:34:07,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:34:07,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:34:07,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:34:07,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:34:07,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:34:07,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:34:07,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:34:07,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:34:07,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:34:07,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:34:07,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:34:07,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:34:07,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:34:07,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:34:07,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:34:07,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:34:07,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:34:07,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:34:07,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:34:07,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:34:07,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:34:07,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:34:07,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:34:07,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:34:07,225 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:34:07,256 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:34:07,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:34:07,257 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:34:07,257 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:34:07,258 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:34:07,258 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:34:07,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:34:07,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:34:07,259 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:34:07,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:34:07,260 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:34:07,260 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:34:07,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:34:07,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:34:07,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:34:07,261 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:34:07,261 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:34:07,261 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:34:07,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:34:07,262 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:34:07,262 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:34:07,262 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:34:07,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:34:07,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:34:07,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:34:07,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:34:07,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:34:07,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:34:07,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:34:07,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:34:07,264 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:34:07,264 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:34:07,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:34:07,264 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:34:07,265 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 -> 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac [2023-02-15 13:34:07,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:34:07,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:34:07,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:34:07,504 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:34:07,504 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:34:07,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2023-02-15 13:34:08,662 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:34:08,804 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:34:08,805 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2023-02-15 13:34:08,811 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3c0c2e9b/836c9d8c7f91408fa5b1e9326c6a8cc7/FLAG443431442 [2023-02-15 13:34:08,823 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3c0c2e9b/836c9d8c7f91408fa5b1e9326c6a8cc7 [2023-02-15 13:34:08,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:34:08,826 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:34:08,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:34:08,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:34:08,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:34:08,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:34:08" (1/1) ... [2023-02-15 13:34:08,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3863be26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:08, skipping insertion in model container [2023-02-15 13:34:08,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:34:08" (1/1) ... [2023-02-15 13:34:08,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:34:08,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:34:08,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:34:08,978 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:34:08,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:34:09,009 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:34:09,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:09 WrapperNode [2023-02-15 13:34:09,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:34:09,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:34:09,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:34:09,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:34:09,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:09" (1/1) ... [2023-02-15 13:34:09,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:09" (1/1) ... [2023-02-15 13:34:09,042 INFO L138 Inliner]: procedures = 13, calls = 20, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 94 [2023-02-15 13:34:09,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:34:09,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:34:09,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:34:09,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:34:09,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:09" (1/1) ... [2023-02-15 13:34:09,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:09" (1/1) ... [2023-02-15 13:34:09,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:09" (1/1) ... [2023-02-15 13:34:09,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:09" (1/1) ... [2023-02-15 13:34:09,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:09" (1/1) ... [2023-02-15 13:34:09,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:09" (1/1) ... [2023-02-15 13:34:09,092 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:09" (1/1) ... [2023-02-15 13:34:09,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:09" (1/1) ... [2023-02-15 13:34:09,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:34:09,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:34:09,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:34:09,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:34:09,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:09" (1/1) ... [2023-02-15 13:34:09,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:34:09,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:09,125 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 13:34:09,132 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 13:34:09,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:34:09,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 13:34:09,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:34:09,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:34:09,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:34:09,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:34:09,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:34:09,253 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:34:09,255 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:34:09,467 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:34:09,472 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:34:09,473 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 13:34:09,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:34:09 BoogieIcfgContainer [2023-02-15 13:34:09,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:34:09,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:34:09,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:34:09,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:34:09,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:34:08" (1/3) ... [2023-02-15 13:34:09,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e0c151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:34:09, skipping insertion in model container [2023-02-15 13:34:09,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:34:09" (2/3) ... [2023-02-15 13:34:09,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e0c151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:34:09, skipping insertion in model container [2023-02-15 13:34:09,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:34:09" (3/3) ... [2023-02-15 13:34:09,482 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4-2.c [2023-02-15 13:34:09,500 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:34:09,500 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2023-02-15 13:34:09,572 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:34:09,581 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;@1767337c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:34:09,581 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-02-15 13:34:09,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 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 13:34:09,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 13:34:09,589 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:09,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 13:34:09,590 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:09,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:09,595 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-02-15 13:34:09,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:09,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067362160] [2023-02-15 13:34:09,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:09,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:09,781 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 13:34:09,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:09,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067362160] [2023-02-15 13:34:09,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067362160] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:09,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:09,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-15 13:34:09,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485929251] [2023-02-15 13:34:09,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:09,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:34:09,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:09,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:34:09,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:34:09,814 INFO L87 Difference]: Start difference. First operand has 53 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 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 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 13:34:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:09,862 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2023-02-15 13:34:09,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:34:09,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-02-15 13:34:09,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:09,870 INFO L225 Difference]: With dead ends: 52 [2023-02-15 13:34:09,870 INFO L226 Difference]: Without dead ends: 50 [2023-02-15 13:34:09,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 13:34:09,875 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:09,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 58 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:34:09,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-15 13:34:09,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-02-15 13:34:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 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 13:34:09,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-15 13:34:09,902 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 4 [2023-02-15 13:34:09,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:09,902 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-15 13:34:09,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 13:34:09,903 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-15 13:34:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 13:34:09,903 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:09,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 13:34:09,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:34:09,904 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:09,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:09,905 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2023-02-15 13:34:09,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:09,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468767052] [2023-02-15 13:34:09,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:09,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:10,019 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 13:34:10,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:10,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468767052] [2023-02-15 13:34:10,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468767052] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:10,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:10,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:34:10,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100750824] [2023-02-15 13:34:10,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:10,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:34:10,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:10,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:34:10,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:34:10,023 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 13:34:10,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:10,071 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2023-02-15 13:34:10,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:34:10,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-02-15 13:34:10,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:10,073 INFO L225 Difference]: With dead ends: 53 [2023-02-15 13:34:10,073 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 13:34:10,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 13:34:10,075 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 53 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:10,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 65 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:34:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 13:34:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2023-02-15 13:34:10,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 51 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 13:34:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2023-02-15 13:34:10,085 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 4 [2023-02-15 13:34:10,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:10,087 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2023-02-15 13:34:10,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 13:34:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2023-02-15 13:34:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 13:34:10,088 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:10,088 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-02-15 13:34:10,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:34:10,089 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:10,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:10,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1809646286, now seen corresponding path program 1 times [2023-02-15 13:34:10,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:10,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468772345] [2023-02-15 13:34:10,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:10,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:10,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:10,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468772345] [2023-02-15 13:34:10,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468772345] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:34:10,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804564656] [2023-02-15 13:34:10,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:10,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:10,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:10,342 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 13:34:10,344 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 13:34:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:10,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 13:34:10,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:10,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:10,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:10,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804564656] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:34:10,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:34:10,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-02-15 13:34:10,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129014783] [2023-02-15 13:34:10,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:34:10,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:34:10,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:10,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:34:10,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:34:10,609 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 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 13:34:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:10,830 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2023-02-15 13:34:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:34:10,830 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 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 7 [2023-02-15 13:34:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:10,833 INFO L225 Difference]: With dead ends: 59 [2023-02-15 13:34:10,833 INFO L226 Difference]: Without dead ends: 59 [2023-02-15 13:34:10,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:34:10,839 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 166 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:10,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 126 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:34:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-15 13:34:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-02-15 13:34:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 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 13:34:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2023-02-15 13:34:10,853 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 7 [2023-02-15 13:34:10,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:10,853 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2023-02-15 13:34:10,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 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 13:34:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2023-02-15 13:34:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 13:34:10,855 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:10,855 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:10,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:11,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:11,060 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:11,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:11,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2129139286, now seen corresponding path program 1 times [2023-02-15 13:34:11,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:11,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229403092] [2023-02-15 13:34:11,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:11,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:11,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:11,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229403092] [2023-02-15 13:34:11,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229403092] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:34:11,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639939240] [2023-02-15 13:34:11,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:11,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:11,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:11,203 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 13:34:11,206 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 13:34:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:11,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 13:34:11,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:11,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:34:11,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639939240] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:34:11,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:34:11,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-15 13:34:11,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377697895] [2023-02-15 13:34:11,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:34:11,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 13:34:11,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:11,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 13:34:11,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:34:11,398 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:11,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:11,441 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2023-02-15 13:34:11,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:34:11,442 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 13:34:11,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:11,442 INFO L225 Difference]: With dead ends: 77 [2023-02-15 13:34:11,443 INFO L226 Difference]: Without dead ends: 77 [2023-02-15 13:34:11,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:34:11,444 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:11,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 290 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:34:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-15 13:34:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-15 13:34:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 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 13:34:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2023-02-15 13:34:11,458 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 19 [2023-02-15 13:34:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:11,458 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2023-02-15 13:34:11,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2023-02-15 13:34:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:34:11,459 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:11,459 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:11,473 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 13:34:11,673 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,SelfDestructingSolverStorable3 [2023-02-15 13:34:11,674 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:11,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:11,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069290, now seen corresponding path program 2 times [2023-02-15 13:34:11,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:11,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816855867] [2023-02-15 13:34:11,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:11,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:11,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:11,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816855867] [2023-02-15 13:34:11,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816855867] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:11,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:11,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:34:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890271147] [2023-02-15 13:34:11,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:11,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:34:11,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:11,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:34:11,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:34:11,959 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 5 states, 4 states have (on average 2.5) 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 13:34:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:12,038 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2023-02-15 13:34:12,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:34:12,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) 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 37 [2023-02-15 13:34:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:12,040 INFO L225 Difference]: With dead ends: 85 [2023-02-15 13:34:12,040 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 13:34:12,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:34:12,041 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 113 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:12,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 64 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:34:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 13:34:12,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2023-02-15 13:34:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.3125) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 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 13:34:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-02-15 13:34:12,059 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 37 [2023-02-15 13:34:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:12,060 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-02-15 13:34:12,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) 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 13:34:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-02-15 13:34:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:34:12,061 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:12,061 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:12,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:34:12,062 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:12,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:12,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069289, now seen corresponding path program 1 times [2023-02-15 13:34:12,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:12,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032672602] [2023-02-15 13:34:12,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:12,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-02-15 13:34:12,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:12,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032672602] [2023-02-15 13:34:12,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032672602] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:12,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:12,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:34:12,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610777349] [2023-02-15 13:34:12,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:12,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:34:12,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:12,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:34:12,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:34:12,151 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:12,197 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2023-02-15 13:34:12,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:34:12,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-15 13:34:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:12,198 INFO L225 Difference]: With dead ends: 78 [2023-02-15 13:34:12,198 INFO L226 Difference]: Without dead ends: 78 [2023-02-15 13:34:12,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:34:12,199 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 63 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:12,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 89 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:34:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-15 13:34:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-02-15 13:34:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.28125) internal successors, (82), 77 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 13:34:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2023-02-15 13:34:12,213 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 37 [2023-02-15 13:34:12,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:12,213 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2023-02-15 13:34:12,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2023-02-15 13:34:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 13:34:12,216 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:12,216 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:12,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 13:34:12,217 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:12,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash -708557702, now seen corresponding path program 1 times [2023-02-15 13:34:12,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:12,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298358690] [2023-02-15 13:34:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:12,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:12,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:12,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298358690] [2023-02-15 13:34:12,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298358690] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:12,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:12,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-15 13:34:12,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929412153] [2023-02-15 13:34:12,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:12,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:34:12,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:12,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:34:12,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:34:12,325 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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 13:34:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:12,344 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2023-02-15 13:34:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:34:12,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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 38 [2023-02-15 13:34:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:12,346 INFO L225 Difference]: With dead ends: 77 [2023-02-15 13:34:12,346 INFO L226 Difference]: Without dead ends: 77 [2023-02-15 13:34:12,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 13:34:12,347 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:12,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 54 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:34:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-15 13:34:12,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-15 13:34:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.265625) internal successors, (81), 76 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 13:34:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2023-02-15 13:34:12,349 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 38 [2023-02-15 13:34:12,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:12,351 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2023-02-15 13:34:12,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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 13:34:12,351 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2023-02-15 13:34:12,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 13:34:12,366 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:12,367 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:12,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 13:34:12,367 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:12,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:12,368 INFO L85 PathProgramCache]: Analyzing trace with hash -708557701, now seen corresponding path program 1 times [2023-02-15 13:34:12,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:12,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344024566] [2023-02-15 13:34:12,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:12,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:12,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344024566] [2023-02-15 13:34:12,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344024566] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:12,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:12,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:34:12,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418107787] [2023-02-15 13:34:12,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:12,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:34:12,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:12,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:34:12,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:34:12,565 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:12,597 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2023-02-15 13:34:12,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:34:12,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-15 13:34:12,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:12,598 INFO L225 Difference]: With dead ends: 80 [2023-02-15 13:34:12,598 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 13:34:12,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 13:34:12,599 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 45 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:12,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 60 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:34:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 13:34:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2023-02-15 13:34:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 77 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 13:34:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2023-02-15 13:34:12,601 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 38 [2023-02-15 13:34:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:12,601 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2023-02-15 13:34:12,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:12,602 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2023-02-15 13:34:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 13:34:12,602 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:12,602 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:12,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 13:34:12,603 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:12,603 INFO L85 PathProgramCache]: Analyzing trace with hash 414994334, now seen corresponding path program 1 times [2023-02-15 13:34:12,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:12,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317901642] [2023-02-15 13:34:12,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:12,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:12,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:12,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317901642] [2023-02-15 13:34:12,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317901642] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:34:12,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558700282] [2023-02-15 13:34:12,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:12,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:12,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:12,769 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 13:34:12,772 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 13:34:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:12,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 13:34:12,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:13,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:13,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558700282] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:34:13,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:34:13,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-02-15 13:34:13,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064211061] [2023-02-15 13:34:13,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:34:13,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:34:13,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:13,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:34:13,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:34:13,252 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 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 13:34:13,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:13,424 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2023-02-15 13:34:13,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:34:13,424 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 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 42 [2023-02-15 13:34:13,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:13,427 INFO L225 Difference]: With dead ends: 98 [2023-02-15 13:34:13,427 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 13:34:13,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2023-02-15 13:34:13,429 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 293 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:13,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 97 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:34:13,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 13:34:13,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2023-02-15 13:34:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 91 states have internal predecessors, (100), 0 states have call successors, (0), 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 13:34:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2023-02-15 13:34:13,432 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 42 [2023-02-15 13:34:13,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:13,433 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2023-02-15 13:34:13,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 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 13:34:13,433 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2023-02-15 13:34:13,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:34:13,437 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:13,437 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:13,442 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 13:34:13,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:13,642 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:13,643 INFO L85 PathProgramCache]: Analyzing trace with hash -20077561, now seen corresponding path program 1 times [2023-02-15 13:34:13,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:13,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736435632] [2023-02-15 13:34:13,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:13,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:13,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:13,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736435632] [2023-02-15 13:34:13,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736435632] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:34:13,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762958302] [2023-02-15 13:34:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:13,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:13,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:13,801 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 13:34:13,826 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 13:34:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:13,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 13:34:13,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:14,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:14,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762958302] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:34:14,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:34:14,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-02-15 13:34:14,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515463036] [2023-02-15 13:34:14,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:34:14,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:34:14,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:14,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:34:14,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:34:14,220 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 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 13:34:14,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:14,374 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2023-02-15 13:34:14,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:34:14,374 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 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 43 [2023-02-15 13:34:14,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:14,375 INFO L225 Difference]: With dead ends: 93 [2023-02-15 13:34:14,375 INFO L226 Difference]: Without dead ends: 93 [2023-02-15 13:34:14,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:34:14,376 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 114 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:14,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 173 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:34:14,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-15 13:34:14,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-02-15 13:34:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.2125) internal successors, (97), 92 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 13:34:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2023-02-15 13:34:14,378 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 43 [2023-02-15 13:34:14,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:14,379 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2023-02-15 13:34:14,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 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 13:34:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2023-02-15 13:34:14,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 13:34:14,380 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:14,380 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:14,386 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 13:34:14,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:14,586 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:14,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:14,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1470341546, now seen corresponding path program 2 times [2023-02-15 13:34:14,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:14,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477562356] [2023-02-15 13:34:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:14,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:14,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477562356] [2023-02-15 13:34:14,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477562356] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:34:14,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747018780] [2023-02-15 13:34:14,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:34:14,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:14,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:14,889 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 13:34:14,892 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 13:34:14,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:34:14,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:34:14,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 13:34:14,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:15,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:15,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747018780] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:34:15,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:34:15,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-02-15 13:34:15,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239207838] [2023-02-15 13:34:15,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:34:15,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 13:34:15,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:15,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 13:34:15,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2023-02-15 13:34:15,647 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:16,249 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2023-02-15 13:34:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:34:16,249 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2023-02-15 13:34:16,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:16,250 INFO L225 Difference]: With dead ends: 137 [2023-02-15 13:34:16,250 INFO L226 Difference]: Without dead ends: 137 [2023-02-15 13:34:16,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 13:34:16,251 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 596 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:16,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 304 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:34:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-15 13:34:16,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2023-02-15 13:34:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 121 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2023-02-15 13:34:16,253 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 57 [2023-02-15 13:34:16,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:16,254 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2023-02-15 13:34:16,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:16,254 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2023-02-15 13:34:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 13:34:16,254 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:16,254 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:16,267 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 13:34:16,465 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,SelfDestructingSolverStorable10 [2023-02-15 13:34:16,465 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:16,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:16,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1664052357, now seen corresponding path program 2 times [2023-02-15 13:34:16,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:16,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294395153] [2023-02-15 13:34:16,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:16,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:16,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:16,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294395153] [2023-02-15 13:34:16,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294395153] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:34:16,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834095080] [2023-02-15 13:34:16,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:34:16,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:16,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:16,744 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 13:34:16,754 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 13:34:16,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 13:34:16,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:34:16,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 13:34:16,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2023-02-15 13:34:17,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2023-02-15 13:34:17,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834095080] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:34:17,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:34:17,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2023-02-15 13:34:17,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60347366] [2023-02-15 13:34:17,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:34:17,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 13:34:17,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:17,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 13:34:17,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:34:17,768 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 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 13:34:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:18,142 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2023-02-15 13:34:18,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:34:18,142 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 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 58 [2023-02-15 13:34:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:18,143 INFO L225 Difference]: With dead ends: 121 [2023-02-15 13:34:18,143 INFO L226 Difference]: Without dead ends: 121 [2023-02-15 13:34:18,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2023-02-15 13:34:18,144 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 334 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:18,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 141 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:34:18,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-15 13:34:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-02-15 13:34:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.18348623853211) internal successors, (129), 120 states have internal predecessors, (129), 0 states have call successors, (0), 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 13:34:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2023-02-15 13:34:18,147 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 58 [2023-02-15 13:34:18,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:18,148 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2023-02-15 13:34:18,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 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 13:34:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2023-02-15 13:34:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-15 13:34:18,149 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:18,149 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:18,160 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 13:34:18,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:18,357 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:18,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:18,357 INFO L85 PathProgramCache]: Analyzing trace with hash 797853176, now seen corresponding path program 1 times [2023-02-15 13:34:18,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:18,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921059613] [2023-02-15 13:34:18,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:18,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:18,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:18,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921059613] [2023-02-15 13:34:18,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921059613] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:34:18,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170630693] [2023-02-15 13:34:18,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:18,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:18,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:18,475 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 13:34:18,495 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 13:34:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:18,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:34:18,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:18,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:18,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170630693] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:34:18,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:34:18,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2023-02-15 13:34:18,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220945697] [2023-02-15 13:34:18,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:34:18,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 13:34:18,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:18,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 13:34:18,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:34:18,721 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 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 13:34:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:18,787 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2023-02-15 13:34:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:34:18,787 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 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 70 [2023-02-15 13:34:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:18,788 INFO L225 Difference]: With dead ends: 121 [2023-02-15 13:34:18,788 INFO L226 Difference]: Without dead ends: 121 [2023-02-15 13:34:18,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 132 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:34:18,789 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:18,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 137 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:34:18,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-15 13:34:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-02-15 13:34:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.146788990825688) internal successors, (125), 120 states have internal predecessors, (125), 0 states have call successors, (0), 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 13:34:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2023-02-15 13:34:18,791 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 70 [2023-02-15 13:34:18,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:18,791 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2023-02-15 13:34:18,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 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 13:34:18,791 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2023-02-15 13:34:18,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-15 13:34:18,792 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:18,792 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:18,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:18,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:18,999 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:18,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:18,999 INFO L85 PathProgramCache]: Analyzing trace with hash -713446614, now seen corresponding path program 3 times [2023-02-15 13:34:18,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:18,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267770483] [2023-02-15 13:34:18,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:18,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 199 proven. 46 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-15 13:34:19,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:19,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267770483] [2023-02-15 13:34:19,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267770483] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:34:19,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182932848] [2023-02-15 13:34:19,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 13:34:19,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:19,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:19,529 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 13:34:19,532 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 13:34:19,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-15 13:34:19,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:34:19,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 13:34:19,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2023-02-15 13:34:20,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:20,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182932848] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:20,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:34:20,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 20 [2023-02-15 13:34:20,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559305723] [2023-02-15 13:34:20,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:20,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:34:20,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:20,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:34:20,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2023-02-15 13:34:20,049 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 13:34:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:20,161 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2023-02-15 13:34:20,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:34:20,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 87 [2023-02-15 13:34:20,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:20,162 INFO L225 Difference]: With dead ends: 120 [2023-02-15 13:34:20,162 INFO L226 Difference]: Without dead ends: 120 [2023-02-15 13:34:20,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2023-02-15 13:34:20,162 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 156 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:20,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 64 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:34:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-15 13:34:20,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2023-02-15 13:34:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 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 13:34:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2023-02-15 13:34:20,165 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 87 [2023-02-15 13:34:20,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:20,165 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2023-02-15 13:34:20,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 13:34:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2023-02-15 13:34:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-02-15 13:34:20,165 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:20,165 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:20,174 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 13:34:20,366 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,SelfDestructingSolverStorable13 [2023-02-15 13:34:20,366 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:20,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1503565048, now seen corresponding path program 2 times [2023-02-15 13:34:20,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:20,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004752482] [2023-02-15 13:34:20,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:20,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-15 13:34:20,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:20,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004752482] [2023-02-15 13:34:20,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004752482] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:20,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:20,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:34:20,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215171464] [2023-02-15 13:34:20,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:20,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:34:20,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:20,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:34:20,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:34:20,556 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:20,597 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2023-02-15 13:34:20,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:34:20,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2023-02-15 13:34:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:20,598 INFO L225 Difference]: With dead ends: 118 [2023-02-15 13:34:20,598 INFO L226 Difference]: Without dead ends: 118 [2023-02-15 13:34:20,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:34:20,599 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 27 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:20,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 100 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:34:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-15 13:34:20,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-02-15 13:34:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 108 states have (on average 1.1296296296296295) internal successors, (122), 117 states have internal predecessors, (122), 0 states have call successors, (0), 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 13:34:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2023-02-15 13:34:20,601 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 90 [2023-02-15 13:34:20,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:20,602 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2023-02-15 13:34:20,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2023-02-15 13:34:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-02-15 13:34:20,603 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:20,603 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:20,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 13:34:20,603 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:20,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:20,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1503565049, now seen corresponding path program 1 times [2023-02-15 13:34:20,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:20,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392939538] [2023-02-15 13:34:20,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:20,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2023-02-15 13:34:20,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:20,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392939538] [2023-02-15 13:34:20,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392939538] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:20,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:20,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:34:20,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578673715] [2023-02-15 13:34:20,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:20,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:34:20,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:20,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:34:20,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:34:20,922 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 13:34:21,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:21,016 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2023-02-15 13:34:21,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:34:21,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 90 [2023-02-15 13:34:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:21,017 INFO L225 Difference]: With dead ends: 125 [2023-02-15 13:34:21,017 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 13:34:21,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:34:21,018 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 85 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:21,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 87 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:34:21,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 13:34:21,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2023-02-15 13:34:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 110 states have (on average 1.1272727272727272) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 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 13:34:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2023-02-15 13:34:21,021 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 90 [2023-02-15 13:34:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:21,022 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2023-02-15 13:34:21,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 13:34:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2023-02-15 13:34:21,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-02-15 13:34:21,023 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:21,023 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:21,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 13:34:21,023 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:21,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:21,024 INFO L85 PathProgramCache]: Analyzing trace with hash -634123742, now seen corresponding path program 1 times [2023-02-15 13:34:21,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:21,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189835164] [2023-02-15 13:34:21,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:21,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-15 13:34:21,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:21,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189835164] [2023-02-15 13:34:21,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189835164] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:21,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:21,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:34:21,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133108303] [2023-02-15 13:34:21,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:21,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:34:21,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:21,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:34:21,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:34:21,110 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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 13:34:21,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:21,124 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2023-02-15 13:34:21,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:34:21,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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 91 [2023-02-15 13:34:21,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:21,125 INFO L225 Difference]: With dead ends: 119 [2023-02-15 13:34:21,125 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 13:34:21,125 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 13:34:21,126 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:21,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:34:21,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 13:34:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-02-15 13:34:21,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 110 states have (on average 1.1181818181818182) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 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 13:34:21,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2023-02-15 13:34:21,128 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 91 [2023-02-15 13:34:21,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:21,128 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2023-02-15 13:34:21,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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 13:34:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2023-02-15 13:34:21,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-02-15 13:34:21,129 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:21,129 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:21,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 13:34:21,130 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:21,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:21,131 INFO L85 PathProgramCache]: Analyzing trace with hash -634123741, now seen corresponding path program 1 times [2023-02-15 13:34:21,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:21,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336955581] [2023-02-15 13:34:21,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:21,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-15 13:34:21,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:21,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336955581] [2023-02-15 13:34:21,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336955581] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:21,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:34:21,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:34:21,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64515136] [2023-02-15 13:34:21,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:21,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:34:21,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:21,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:34:21,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:34:21,283 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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 13:34:21,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:21,306 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2023-02-15 13:34:21,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:34:21,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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 91 [2023-02-15 13:34:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:21,307 INFO L225 Difference]: With dead ends: 122 [2023-02-15 13:34:21,307 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 13:34:21,307 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 13:34:21,308 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:21,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:34:21,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 13:34:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2023-02-15 13:34:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 111 states have (on average 1.117117117117117) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 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 13:34:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2023-02-15 13:34:21,311 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 91 [2023-02-15 13:34:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:21,311 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2023-02-15 13:34:21,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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 13:34:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2023-02-15 13:34:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-02-15 13:34:21,312 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:21,313 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:21,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 13:34:21,313 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:21,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:21,314 INFO L85 PathProgramCache]: Analyzing trace with hash 789303046, now seen corresponding path program 1 times [2023-02-15 13:34:21,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:21,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648080299] [2023-02-15 13:34:21,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:21,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2023-02-15 13:34:21,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:21,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648080299] [2023-02-15 13:34:21,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648080299] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:34:21,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562855059] [2023-02-15 13:34:21,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:21,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:21,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:21,689 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 13:34:21,693 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 13:34:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:21,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 13:34:21,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:22,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:34:22,421 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 13:34:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-15 13:34:22,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-15 13:34:29,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562855059] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:34:29,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:34:29,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2023-02-15 13:34:29,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733650328] [2023-02-15 13:34:29,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:34:29,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 13:34:29,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:29,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 13:34:29,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:34:29,387 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:29,728 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2023-02-15 13:34:29,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:34:29,728 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2023-02-15 13:34:29,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:29,729 INFO L225 Difference]: With dead ends: 180 [2023-02-15 13:34:29,729 INFO L226 Difference]: Without dead ends: 180 [2023-02-15 13:34:29,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2023-02-15 13:34:29,730 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 256 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:29,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 239 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:34:29,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-02-15 13:34:29,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2023-02-15 13:34:29,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.136) internal successors, (142), 133 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2023-02-15 13:34:29,733 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 95 [2023-02-15 13:34:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:29,733 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2023-02-15 13:34:29,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2023-02-15 13:34:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-02-15 13:34:29,733 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:29,734 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:29,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:29,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:29,941 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:29,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:29,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1301409354, now seen corresponding path program 1 times [2023-02-15 13:34:29,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:29,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189494221] [2023-02-15 13:34:29,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:29,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-15 13:34:30,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:30,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189494221] [2023-02-15 13:34:30,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189494221] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:34:30,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501507698] [2023-02-15 13:34:30,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:30,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:30,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:30,099 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:34:30,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 13:34:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:30,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:34:30,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:30,243 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 13:34:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-15 13:34:30,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-15 13:34:30,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501507698] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:34:30,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:34:30,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-02-15 13:34:30,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068236230] [2023-02-15 13:34:30,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:34:30,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:34:30,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:30,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:34:30,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:34:30,343 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 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 13:34:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:30,413 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2023-02-15 13:34:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:34:30,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 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 96 [2023-02-15 13:34:30,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:30,414 INFO L225 Difference]: With dead ends: 137 [2023-02-15 13:34:30,415 INFO L226 Difference]: Without dead ends: 137 [2023-02-15 13:34:30,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:34:30,415 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:30,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 99 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:34:30,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-15 13:34:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-02-15 13:34:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 126 states have (on average 1.119047619047619) internal successors, (141), 134 states have internal predecessors, (141), 0 states have call successors, (0), 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 13:34:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2023-02-15 13:34:30,418 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 96 [2023-02-15 13:34:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:30,419 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2023-02-15 13:34:30,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 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 13:34:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2023-02-15 13:34:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-02-15 13:34:30,419 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:30,420 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:30,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:30,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:30,626 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:30,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:30,626 INFO L85 PathProgramCache]: Analyzing trace with hash -265893408, now seen corresponding path program 1 times [2023-02-15 13:34:30,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:30,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267522661] [2023-02-15 13:34:30,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:30,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-15 13:34:30,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:30,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267522661] [2023-02-15 13:34:30,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267522661] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:34:30,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392412985] [2023-02-15 13:34:30,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:30,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:30,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:30,728 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:34:30,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 13:34:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:30,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 13:34:30,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-15 13:34:30,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:30,933 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-15 13:34:30,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392412985] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:34:30,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:34:30,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-02-15 13:34:30,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973695152] [2023-02-15 13:34:30,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:34:30,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:34:30,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:30,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:34:30,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:34:30,935 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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 13:34:30,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:30,968 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2023-02-15 13:34:30,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:34:30,969 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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 103 [2023-02-15 13:34:30,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:30,970 INFO L225 Difference]: With dead ends: 145 [2023-02-15 13:34:30,970 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 13:34:30,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:34:30,971 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:30,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 157 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:34:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 13:34:30,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2023-02-15 13:34:30,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 134 states have (on average 1.1119402985074627) internal successors, (149), 142 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2023-02-15 13:34:30,974 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 103 [2023-02-15 13:34:30,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:30,974 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2023-02-15 13:34:30,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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 13:34:30,975 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2023-02-15 13:34:30,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-02-15 13:34:30,975 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:30,975 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:30,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:31,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-15 13:34:31,182 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:31,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:31,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1508601145, now seen corresponding path program 2 times [2023-02-15 13:34:31,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:31,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152325408] [2023-02-15 13:34:31,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:31,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:31,642 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 28 proven. 38 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2023-02-15 13:34:31,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:31,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152325408] [2023-02-15 13:34:31,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152325408] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:34:31,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123739837] [2023-02-15 13:34:31,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:34:31,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:31,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:31,645 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:34:31,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 13:34:31,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:34:31,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:34:31,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 13:34:31,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:32,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:34:32,403 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 13:34:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-15 13:34:32,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:34:32,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123739837] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:34:32,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:34:32,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 16 [2023-02-15 13:34:32,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396335953] [2023-02-15 13:34:32,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:34:32,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:34:32,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:32,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:34:32,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:34:32,645 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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 13:34:32,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:32,877 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2023-02-15 13:34:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:34:32,878 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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 110 [2023-02-15 13:34:32,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:32,878 INFO L225 Difference]: With dead ends: 142 [2023-02-15 13:34:32,878 INFO L226 Difference]: Without dead ends: 142 [2023-02-15 13:34:32,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2023-02-15 13:34:32,879 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 47 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:32,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 108 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:34:32,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-15 13:34:32,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-02-15 13:34:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 134 states have (on average 1.0970149253731343) internal successors, (147), 141 states have internal predecessors, (147), 0 states have call successors, (0), 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 13:34:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2023-02-15 13:34:32,882 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 110 [2023-02-15 13:34:32,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:32,882 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2023-02-15 13:34:32,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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 13:34:32,883 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2023-02-15 13:34:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-02-15 13:34:32,883 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:32,884 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:32,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:33,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-15 13:34:33,090 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:33,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:33,091 INFO L85 PathProgramCache]: Analyzing trace with hash -478004765, now seen corresponding path program 2 times [2023-02-15 13:34:33,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:33,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644503103] [2023-02-15 13:34:33,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:33,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-15 13:34:33,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:33,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644503103] [2023-02-15 13:34:33,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644503103] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:34:33,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634176554] [2023-02-15 13:34:33,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:34:33,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:33,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:33,327 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:34:33,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 13:34:33,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 13:34:33,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:34:33,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 13:34:33,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:33,559 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 13:34:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2023-02-15 13:34:33,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2023-02-15 13:34:33,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634176554] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:34:33,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:34:33,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2023-02-15 13:34:33,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086083246] [2023-02-15 13:34:33,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:34:33,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 13:34:33,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:33,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 13:34:34,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-02-15 13:34:34,000 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 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 13:34:34,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:34,287 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2023-02-15 13:34:34,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:34:34,288 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2023-02-15 13:34:34,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:34,289 INFO L225 Difference]: With dead ends: 142 [2023-02-15 13:34:34,289 INFO L226 Difference]: Without dead ends: 142 [2023-02-15 13:34:34,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2023-02-15 13:34:34,290 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 258 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:34,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 173 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:34:34,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-15 13:34:34,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2023-02-15 13:34:34,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 140 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:34:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2023-02-15 13:34:34,293 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 111 [2023-02-15 13:34:34,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:34,293 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2023-02-15 13:34:34,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 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 13:34:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2023-02-15 13:34:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-02-15 13:34:34,294 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:34,294 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:34,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:34,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-15 13:34:34,500 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:34,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:34,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1693145504, now seen corresponding path program 2 times [2023-02-15 13:34:34,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:34,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145223112] [2023-02-15 13:34:34,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:34:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-15 13:34:34,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:34:34,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145223112] [2023-02-15 13:34:34,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145223112] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:34:34,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612984904] [2023-02-15 13:34:34,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:34:34,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:34,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:34:34,677 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:34:34,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 13:34:34,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:34:34,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:34:34,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:34:34,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:34:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-15 13:34:34,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:34:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2023-02-15 13:34:35,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612984904] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:34:35,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:34:35,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2023-02-15 13:34:35,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127404046] [2023-02-15 13:34:35,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:34:35,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 13:34:35,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:34:35,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 13:34:35,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:34:35,031 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 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 13:34:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:34:35,080 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2023-02-15 13:34:35,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:34:35,081 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 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 123 [2023-02-15 13:34:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:34:35,081 INFO L225 Difference]: With dead ends: 161 [2023-02-15 13:34:35,081 INFO L226 Difference]: Without dead ends: 161 [2023-02-15 13:34:35,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 238 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:34:35,082 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:34:35,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 124 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:34:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-15 13:34:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2023-02-15 13:34:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 154 states have (on average 1.0714285714285714) internal successors, (165), 160 states have internal predecessors, (165), 0 states have call successors, (0), 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 13:34:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2023-02-15 13:34:35,085 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 123 [2023-02-15 13:34:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:34:35,085 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2023-02-15 13:34:35,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 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 13:34:35,086 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2023-02-15 13:34:35,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-02-15 13:34:35,086 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:34:35,086 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:35,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 13:34:35,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:34:35,294 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-15 13:34:35,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:34:35,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1282766496, now seen corresponding path program 3 times [2023-02-15 13:34:35,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:34:35,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074417789] [2023-02-15 13:34:35,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:34:35,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:34:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:34:35,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 13:34:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:34:35,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 13:34:35,506 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 13:34:35,507 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2023-02-15 13:34:35,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2023-02-15 13:34:35,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2023-02-15 13:34:35,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2023-02-15 13:34:35,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2023-02-15 13:34:35,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2023-02-15 13:34:35,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2023-02-15 13:34:35,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2023-02-15 13:34:35,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2023-02-15 13:34:35,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2023-02-15 13:34:35,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2023-02-15 13:34:35,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2023-02-15 13:34:35,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2023-02-15 13:34:35,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2023-02-15 13:34:35,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2023-02-15 13:34:35,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2023-02-15 13:34:35,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2023-02-15 13:34:35,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-15 13:34:35,518 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:34:35,522 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 13:34:35,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:34:35 BoogieIcfgContainer [2023-02-15 13:34:35,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 13:34:35,606 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 13:34:35,606 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 13:34:35,607 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 13:34:35,607 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:34:09" (3/4) ... [2023-02-15 13:34:35,609 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 13:34:35,680 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 13:34:35,681 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 13:34:35,681 INFO L158 Benchmark]: Toolchain (without parser) took 26854.86ms. Allocated memory was 127.9MB in the beginning and 308.3MB in the end (delta: 180.4MB). Free memory was 85.4MB in the beginning and 116.8MB in the end (delta: -31.4MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB. [2023-02-15 13:34:35,681 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory was 53.1MB in the beginning and 52.9MB in the end (delta: 188.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:34:35,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.75ms. Allocated memory is still 127.9MB. Free memory was 85.4MB in the beginning and 75.1MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 13:34:35,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.56ms. Allocated memory is still 127.9MB. Free memory was 75.1MB in the beginning and 73.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:34:35,682 INFO L158 Benchmark]: Boogie Preprocessor took 53.96ms. Allocated memory is still 127.9MB. Free memory was 73.1MB in the beginning and 71.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:34:35,682 INFO L158 Benchmark]: RCFGBuilder took 377.22ms. Allocated memory is still 127.9MB. Free memory was 71.9MB in the beginning and 56.9MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 13:34:35,683 INFO L158 Benchmark]: TraceAbstraction took 26129.55ms. Allocated memory was 127.9MB in the beginning and 308.3MB in the end (delta: 180.4MB). Free memory was 56.4MB in the beginning and 126.3MB in the end (delta: -69.9MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. [2023-02-15 13:34:35,683 INFO L158 Benchmark]: Witness Printer took 74.25ms. Allocated memory is still 308.3MB. Free memory was 126.3MB in the beginning and 116.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 13:34:35,684 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory was 53.1MB in the beginning and 52.9MB in the end (delta: 188.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.75ms. Allocated memory is still 127.9MB. Free memory was 85.4MB in the beginning and 75.1MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.56ms. Allocated memory is still 127.9MB. Free memory was 75.1MB in the beginning and 73.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.96ms. Allocated memory is still 127.9MB. Free memory was 73.1MB in the beginning and 71.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 377.22ms. Allocated memory is still 127.9MB. Free memory was 71.9MB in the beginning and 56.9MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 26129.55ms. Allocated memory was 127.9MB in the beginning and 308.3MB in the end (delta: 180.4MB). Free memory was 56.4MB in the beginning and 126.3MB in the end (delta: -69.9MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. * Witness Printer took 74.25ms. Allocated memory is still 308.3MB. Free memory was 126.3MB in the beginning and 116.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] static int array[10]; [L17] static int numbers2[10]; [L36] static int numbers4[10]; VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L45] CALL getNumbers4() [L35] CALL, EXPR getNumbers3() [L25] CALL, EXPR getNumbers2() [L16] CALL, EXPR getNumbers() [L8] int i = 0; VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=1, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=1, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=2, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=2, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=3, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=3, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=4, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=4, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=5, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=5, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=6, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=6, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=7, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=7, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=8, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=8, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=9, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, i=9, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=10, numbers2={2:0}, numbers4={3:0}] [L8] COND FALSE !(i < 10) VAL [array={1:0}, i=10, numbers2={2:0}, numbers4={3:0}] [L12] return array; VAL [\result={1:0}, array={1:0}, i=10, numbers2={2:0}, numbers4={3:0}] [L16] RET, EXPR getNumbers() [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={1:0}, i=0, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=0, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=0] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=0, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=0] [L18] ++i VAL [array={1:0}, i=1, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=1, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=1] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=1, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=1] [L18] ++i VAL [array={1:0}, i=2, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=2, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=2] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=2, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=2] [L18] ++i VAL [array={1:0}, i=3, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=3, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=3] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=3, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=3] [L18] ++i VAL [array={1:0}, i=4, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=4, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=4] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=4, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=4] [L18] ++i VAL [array={1:0}, i=5, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=5, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=5] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=5, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=5] [L18] ++i VAL [array={1:0}, i=6, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=6, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=6] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=6, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=6] [L18] ++i VAL [array={1:0}, i=7, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=7, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=7] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=7, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=7] [L18] ++i VAL [array={1:0}, i=8, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=8, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=8] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=8, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=8] [L18] ++i VAL [array={1:0}, i=9, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] EXPR numbers[i] VAL [array={1:0}, i=9, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=9] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, i=9, numbers={1:0}, numbers2={2:0}, numbers4={3:0}, numbers[i]=9] [L18] ++i VAL [array={1:0}, i=10, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] COND FALSE !(i < 10) VAL [array={1:0}, i=10, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L21] return numbers2; VAL [\result={2:0}, array={1:0}, i=10, numbers={1:0}, numbers2={2:0}, numbers4={3:0}] [L25] RET, EXPR getNumbers2() [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={1:0}, i=0, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=0, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=0] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=0, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=0] [L27] ++i VAL [array={1:0}, i=1, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=1, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=1] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=1, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=1] [L27] ++i VAL [array={1:0}, i=2, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=2, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=2] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=2, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=2] [L27] ++i VAL [array={1:0}, i=3, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=3, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=3] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=3, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=3] [L27] ++i VAL [array={1:0}, i=4, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=4, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=4] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=4, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=4] [L27] ++i VAL [array={1:0}, i=5, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=5, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=5] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=5, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=5] [L27] ++i VAL [array={1:0}, i=6, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=6, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=6] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=6, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=6] [L27] ++i VAL [array={1:0}, i=7, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=7, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=7] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=7, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=7] [L27] ++i VAL [array={1:0}, i=8, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=8, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=8] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=8, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=8] [L27] ++i VAL [array={1:0}, i=9, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L28] EXPR numbers[i] VAL [array={1:0}, i=9, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=9] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, i=9, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers[i]=9] [L27] ++i VAL [array={1:0}, i=10, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L27] COND FALSE !(i < 10) VAL [array={1:0}, i=10, numbers={2:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}] [L31] return numbers3; [L31] return numbers3; VAL [\result={10:0}, array={1:0}, i=10, numbers={2:0}, numbers2={2:0}, numbers4={3:0}] [L35] RET, EXPR getNumbers3() [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={1:0}, i=0, numbers={10:0}, numbers2={2:0}, numbers4={3:0}] [L37] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers={10:0}, numbers2={2:0}, numbers4={3:0}] [L38] numbers[i] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 26.0s, OverallIterations: 25, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2696 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2696 mSDsluCounter, 2947 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2063 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2069 IncrementalHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 884 mSDtfsCounter, 2069 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2010 GetRequests, 1729 SyntacticMatches, 8 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=24, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 89 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 17.0s InterpolantComputationTime, 2705 NumberOfCodeBlocks, 2483 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 3336 ConstructedInterpolants, 87 QuantifiedInterpolants, 28438 SizeOfPredicates, 34 NumberOfNonLiveVariables, 3386 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 50 InterpolantComputations, 12 PerfectInterpolantSequences, 11651/12566 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-15 13:34:35,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)