./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc03d948b3133d1e09e5b9df570e018433e0831cbe27440ede702c2678003704 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 05:25:45,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:25:45,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:25:45,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:25:45,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:25:45,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:25:45,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:25:45,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:25:45,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:25:45,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:25:45,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:25:45,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:25:45,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:25:45,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:25:45,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:25:45,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:25:45,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:25:45,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:25:45,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:25:45,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:25:45,185 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:25:45,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:25:45,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:25:45,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:25:45,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:25:45,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:25:45,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:25:45,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:25:45,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:25:45,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:25:45,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:25:45,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:25:45,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:25:45,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:25:45,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:25:45,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:25:45,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:25:45,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:25:45,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:25:45,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:25:45,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:25:45,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:25:45,203 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-23 05:25:45,221 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:25:45,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:25:45,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:25:45,222 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:25:45,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:25:45,223 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:25:45,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:25:45,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:25:45,223 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:25:45,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:25:45,224 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:25:45,224 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:25:45,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:25:45,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:25:45,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:25:45,225 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:25:45,225 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:25:45,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:25:45,225 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:25:45,225 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:25:45,225 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:25:45,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:25:45,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:25:45,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:25:45,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:25:45,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:25:45,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:25:45,227 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 05:25:45,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 05:25:45,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> fc03d948b3133d1e09e5b9df570e018433e0831cbe27440ede702c2678003704 [2022-07-23 05:25:45,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:25:45,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:25:45,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:25:45,465 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:25:45,466 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:25:45,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i [2022-07-23 05:25:45,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82135435/7821db0eafbf4d1db0413481614f4ab3/FLAGba30053fb [2022-07-23 05:25:46,098 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:25:46,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i [2022-07-23 05:25:46,123 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82135435/7821db0eafbf4d1db0413481614f4ab3/FLAGba30053fb [2022-07-23 05:25:46,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82135435/7821db0eafbf4d1db0413481614f4ab3 [2022-07-23 05:25:46,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:25:46,563 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:25:46,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:25:46,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:25:46,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:25:46,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:25:46" (1/1) ... [2022-07-23 05:25:46,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b5b8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:46, skipping insertion in model container [2022-07-23 05:25:46,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:25:46" (1/1) ... [2022-07-23 05:25:46,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:25:46,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:25:46,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i[22617,22630] [2022-07-23 05:25:46,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:25:46,908 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 05:25:46,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i[22617,22630] [2022-07-23 05:25:46,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:25:46,963 INFO L208 MainTranslator]: Completed translation [2022-07-23 05:25:46,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:46 WrapperNode [2022-07-23 05:25:46,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:25:46,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 05:25:46,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 05:25:46,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 05:25:46,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:46" (1/1) ... [2022-07-23 05:25:46,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:46" (1/1) ... [2022-07-23 05:25:47,009 INFO L137 Inliner]: procedures = 119, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 115 [2022-07-23 05:25:47,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 05:25:47,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 05:25:47,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 05:25:47,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 05:25:47,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:46" (1/1) ... [2022-07-23 05:25:47,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:46" (1/1) ... [2022-07-23 05:25:47,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:46" (1/1) ... [2022-07-23 05:25:47,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:46" (1/1) ... [2022-07-23 05:25:47,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:46" (1/1) ... [2022-07-23 05:25:47,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:46" (1/1) ... [2022-07-23 05:25:47,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:46" (1/1) ... [2022-07-23 05:25:47,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 05:25:47,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 05:25:47,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 05:25:47,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 05:25:47,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:46" (1/1) ... [2022-07-23 05:25:47,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:25:47,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:47,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 05:25:47,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 05:25:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 05:25:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 05:25:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 05:25:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 05:25:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 05:25:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 05:25:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 05:25:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 05:25:47,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 05:25:47,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 05:25:47,214 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 05:25:47,215 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 05:25:47,449 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 05:25:47,453 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 05:25:47,453 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-23 05:25:47,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:25:47 BoogieIcfgContainer [2022-07-23 05:25:47,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 05:25:47,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 05:25:47,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 05:25:47,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 05:25:47,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 05:25:46" (1/3) ... [2022-07-23 05:25:47,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689d9dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:25:47, skipping insertion in model container [2022-07-23 05:25:47,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:46" (2/3) ... [2022-07-23 05:25:47,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689d9dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:25:47, skipping insertion in model container [2022-07-23 05:25:47,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:25:47" (3/3) ... [2022-07-23 05:25:47,460 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-2.i [2022-07-23 05:25:47,469 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 05:25:47,469 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 49 error locations. [2022-07-23 05:25:47,496 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 05:25:47,500 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f8a0642, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15928d6c [2022-07-23 05:25:47,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2022-07-23 05:25:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 57 states have (on average 2.1403508771929824) internal successors, (122), 106 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) [2022-07-23 05:25:47,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 05:25:47,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:47,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 05:25:47,507 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-07-23 05:25:47,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:47,510 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-23 05:25:47,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:47,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934072407] [2022-07-23 05:25:47,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:47,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:47,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:47,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934072407] [2022-07-23 05:25:47,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934072407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:47,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:47,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:25:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944146686] [2022-07-23 05:25:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:47,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:25:47,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:47,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:25:47,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:25:47,684 INFO L87 Difference]: Start difference. First operand has 107 states, 57 states have (on average 2.1403508771929824) internal successors, (122), 106 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:47,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:47,789 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2022-07-23 05:25:47,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:25:47,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-23 05:25:47,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:47,797 INFO L225 Difference]: With dead ends: 135 [2022-07-23 05:25:47,797 INFO L226 Difference]: Without dead ends: 131 [2022-07-23 05:25:47,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:25:47,800 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 93 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:47,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 114 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:25:47,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-23 05:25:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 102. [2022-07-23 05:25:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 55 states have (on average 1.9636363636363636) internal successors, (108), 101 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:47,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2022-07-23 05:25:47,836 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 3 [2022-07-23 05:25:47,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:47,836 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2022-07-23 05:25:47,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:47,837 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-07-23 05:25:47,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 05:25:47,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:47,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 05:25:47,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 05:25:47,839 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-07-23 05:25:47,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:47,840 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-23 05:25:47,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:47,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76448559] [2022-07-23 05:25:47,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:47,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:47,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:47,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76448559] [2022-07-23 05:25:47,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76448559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:47,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:47,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:25:47,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644078638] [2022-07-23 05:25:47,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:47,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:25:47,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:47,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:25:47,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:25:47,919 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:48,023 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-07-23 05:25:48,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:25:48,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-23 05:25:48,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:48,025 INFO L225 Difference]: With dead ends: 129 [2022-07-23 05:25:48,025 INFO L226 Difference]: Without dead ends: 129 [2022-07-23 05:25:48,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:25:48,027 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 89 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:48,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 110 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:25:48,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-23 05:25:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 100. [2022-07-23 05:25:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 55 states have (on average 1.9272727272727272) internal successors, (106), 99 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-07-23 05:25:48,037 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 3 [2022-07-23 05:25:48,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:48,037 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-07-23 05:25:48,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-07-23 05:25:48,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 05:25:48,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:48,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:48,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 05:25:48,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-07-23 05:25:48,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:48,042 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2022-07-23 05:25:48,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:48,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828978190] [2022-07-23 05:25:48,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:48,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:48,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:48,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828978190] [2022-07-23 05:25:48,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828978190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:48,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:48,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:25:48,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158954079] [2022-07-23 05:25:48,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:48,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:25:48,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:48,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:25:48,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:25:48,092 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:48,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:48,205 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2022-07-23 05:25:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:25:48,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-23 05:25:48,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:48,206 INFO L225 Difference]: With dead ends: 103 [2022-07-23 05:25:48,207 INFO L226 Difference]: Without dead ends: 103 [2022-07-23 05:25:48,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:25:48,208 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 139 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:48,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 44 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:25:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-23 05:25:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2022-07-23 05:25:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2022-07-23 05:25:48,213 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 8 [2022-07-23 05:25:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:48,213 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2022-07-23 05:25:48,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-07-23 05:25:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 05:25:48,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:48,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:48,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 05:25:48,214 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-07-23 05:25:48,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2022-07-23 05:25:48,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:48,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301353736] [2022-07-23 05:25:48,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:48,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:48,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:48,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301353736] [2022-07-23 05:25:48,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301353736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:48,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:48,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:25:48,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892508772] [2022-07-23 05:25:48,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:48,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:25:48,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:48,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:25:48,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:25:48,268 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:48,426 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2022-07-23 05:25:48,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:25:48,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-23 05:25:48,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:48,428 INFO L225 Difference]: With dead ends: 133 [2022-07-23 05:25:48,428 INFO L226 Difference]: Without dead ends: 133 [2022-07-23 05:25:48,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:25:48,429 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 150 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:48,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 65 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:25:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-23 05:25:48,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 112. [2022-07-23 05:25:48,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 111 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2022-07-23 05:25:48,434 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 8 [2022-07-23 05:25:48,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:48,435 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2022-07-23 05:25:48,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:48,435 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2022-07-23 05:25:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 05:25:48,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:48,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:48,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 05:25:48,436 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-07-23 05:25:48,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:48,437 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-07-23 05:25:48,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:48,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481571540] [2022-07-23 05:25:48,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:48,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:48,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:48,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481571540] [2022-07-23 05:25:48,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481571540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:48,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:48,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:25:48,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497559646] [2022-07-23 05:25:48,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:48,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:25:48,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:48,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:25:48,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:25:48,487 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:48,646 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2022-07-23 05:25:48,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 05:25:48,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 05:25:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:48,648 INFO L225 Difference]: With dead ends: 113 [2022-07-23 05:25:48,648 INFO L226 Difference]: Without dead ends: 113 [2022-07-23 05:25:48,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-23 05:25:48,651 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 52 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:48,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 181 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:25:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-23 05:25:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-07-23 05:25:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 82 states have (on average 1.524390243902439) internal successors, (125), 110 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) [2022-07-23 05:25:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-07-23 05:25:48,680 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 12 [2022-07-23 05:25:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:48,680 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-07-23 05:25:48,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-07-23 05:25:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 05:25:48,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:48,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:48,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 05:25:48,681 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-07-23 05:25:48,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:48,682 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-07-23 05:25:48,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:48,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907994640] [2022-07-23 05:25:48,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:48,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:48,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:48,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907994640] [2022-07-23 05:25:48,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907994640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:48,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:48,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:25:48,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98931058] [2022-07-23 05:25:48,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:48,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:25:48,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:48,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:25:48,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:25:48,775 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:48,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:48,947 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2022-07-23 05:25:48,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 05:25:48,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 05:25:48,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:48,949 INFO L225 Difference]: With dead ends: 111 [2022-07-23 05:25:48,949 INFO L226 Difference]: Without dead ends: 111 [2022-07-23 05:25:48,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-23 05:25:48,949 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 13 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:48,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 231 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:25:48,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-23 05:25:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2022-07-23 05:25:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 101 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2022-07-23 05:25:48,953 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 12 [2022-07-23 05:25:48,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:48,953 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2022-07-23 05:25:48,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2022-07-23 05:25:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 05:25:48,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:48,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:48,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 05:25:48,954 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-07-23 05:25:48,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:48,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1831378933, now seen corresponding path program 1 times [2022-07-23 05:25:48,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:48,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934100689] [2022-07-23 05:25:48,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:48,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:49,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:49,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:49,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934100689] [2022-07-23 05:25:49,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934100689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:49,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:49,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:25:49,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761341595] [2022-07-23 05:25:49,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:49,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:25:49,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:49,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:25:49,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:25:49,004 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:49,104 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2022-07-23 05:25:49,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:25:49,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-23 05:25:49,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:49,105 INFO L225 Difference]: With dead ends: 113 [2022-07-23 05:25:49,105 INFO L226 Difference]: Without dead ends: 113 [2022-07-23 05:25:49,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:25:49,106 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 16 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:49,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 232 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:25:49,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-23 05:25:49,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-07-23 05:25:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 107 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) [2022-07-23 05:25:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2022-07-23 05:25:49,110 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 15 [2022-07-23 05:25:49,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:49,110 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2022-07-23 05:25:49,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2022-07-23 05:25:49,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:25:49,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:49,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:49,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 05:25:49,111 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-07-23 05:25:49,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:49,112 INFO L85 PathProgramCache]: Analyzing trace with hash -555036255, now seen corresponding path program 1 times [2022-07-23 05:25:49,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:49,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050617596] [2022-07-23 05:25:49,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:49,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:49,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:49,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050617596] [2022-07-23 05:25:49,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050617596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:49,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:49,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:25:49,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534146118] [2022-07-23 05:25:49,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:49,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:25:49,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:49,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:25:49,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:25:49,170 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:49,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:49,272 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2022-07-23 05:25:49,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:25:49,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-07-23 05:25:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:49,273 INFO L225 Difference]: With dead ends: 107 [2022-07-23 05:25:49,273 INFO L226 Difference]: Without dead ends: 107 [2022-07-23 05:25:49,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:25:49,274 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 6 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:49,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 194 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:25:49,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-23 05:25:49,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-23 05:25:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 106 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2022-07-23 05:25:49,277 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 17 [2022-07-23 05:25:49,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:49,277 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2022-07-23 05:25:49,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-07-23 05:25:49,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:25:49,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:49,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:49,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 05:25:49,278 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-07-23 05:25:49,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:49,279 INFO L85 PathProgramCache]: Analyzing trace with hash -555036254, now seen corresponding path program 1 times [2022-07-23 05:25:49,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:49,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111024342] [2022-07-23 05:25:49,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:49,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:49,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:49,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111024342] [2022-07-23 05:25:49,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111024342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:49,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:49,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:25:49,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614026830] [2022-07-23 05:25:49,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:49,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:25:49,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:49,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:25:49,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:25:49,355 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:49,458 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-07-23 05:25:49,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:25:49,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-07-23 05:25:49,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:49,459 INFO L225 Difference]: With dead ends: 106 [2022-07-23 05:25:49,459 INFO L226 Difference]: Without dead ends: 106 [2022-07-23 05:25:49,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:25:49,460 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:49,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 189 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:25:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-23 05:25:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-23 05:25:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 105 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2022-07-23 05:25:49,462 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 17 [2022-07-23 05:25:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:49,462 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2022-07-23 05:25:49,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-07-23 05:25:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:25:49,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:49,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:49,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 05:25:49,463 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-07-23 05:25:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:49,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1499933727, now seen corresponding path program 1 times [2022-07-23 05:25:49,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:49,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883740189] [2022-07-23 05:25:49,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:49,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:49,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:49,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883740189] [2022-07-23 05:25:49,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883740189] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:25:49,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572298741] [2022-07-23 05:25:49,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:49,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:25:49,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:49,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:25:49,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 05:25:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:49,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 05:25:49,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:25:49,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:25:49,653 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 05:25:49,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 05:25:49,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:25:49,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-23 05:25:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:49,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:25:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:49,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572298741] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:25:49,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:25:49,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-23 05:25:49,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266612151] [2022-07-23 05:25:49,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:25:49,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 05:25:49,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:49,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 05:25:49,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-23 05:25:49,815 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:50,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:50,110 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2022-07-23 05:25:50,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 05:25:50,111 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-23 05:25:50,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:50,111 INFO L225 Difference]: With dead ends: 152 [2022-07-23 05:25:50,111 INFO L226 Difference]: Without dead ends: 152 [2022-07-23 05:25:50,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-07-23 05:25:50,112 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 342 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:50,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 160 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 377 Invalid, 0 Unknown, 17 Unchecked, 0.2s Time] [2022-07-23 05:25:50,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-23 05:25:50,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 109. [2022-07-23 05:25:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 108 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) [2022-07-23 05:25:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2022-07-23 05:25:50,114 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 18 [2022-07-23 05:25:50,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:50,114 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2022-07-23 05:25:50,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-07-23 05:25:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:25:50,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:50,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:50,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-23 05:25:50,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-23 05:25:50,323 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-07-23 05:25:50,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:50,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1499933728, now seen corresponding path program 1 times [2022-07-23 05:25:50,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:50,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960550313] [2022-07-23 05:25:50,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:50,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:50,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:50,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960550313] [2022-07-23 05:25:50,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960550313] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:25:50,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496808766] [2022-07-23 05:25:50,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:50,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:25:50,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:50,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:25:50,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 05:25:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:50,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-23 05:25:50,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:25:50,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:25:50,667 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:25:50,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 05:25:50,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:25:50,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:25:50,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:25:50,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-23 05:25:50,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-23 05:25:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:50,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:25:55,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-07-23 05:25:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:55,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496808766] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:25:55,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:25:55,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-07-23 05:25:55,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318053376] [2022-07-23 05:25:55,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:25:55,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-23 05:25:55,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:55,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-23 05:25:55,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-07-23 05:25:55,244 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:56,235 INFO L93 Difference]: Finished difference Result 173 states and 188 transitions. [2022-07-23 05:25:56,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 05:25:56,236 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-23 05:25:56,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:56,238 INFO L225 Difference]: With dead ends: 173 [2022-07-23 05:25:56,238 INFO L226 Difference]: Without dead ends: 173 [2022-07-23 05:25:56,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=246, Invalid=1014, Unknown=0, NotChecked=0, Total=1260 [2022-07-23 05:25:56,239 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 699 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:56,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 369 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 828 Invalid, 0 Unknown, 43 Unchecked, 0.5s Time] [2022-07-23 05:25:56,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-23 05:25:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 108. [2022-07-23 05:25:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 107 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:56,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2022-07-23 05:25:56,243 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 18 [2022-07-23 05:25:56,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:56,244 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2022-07-23 05:25:56,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:56,244 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2022-07-23 05:25:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 05:25:56,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:56,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:56,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 05:25:56,455 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,SelfDestructingSolverStorable10 [2022-07-23 05:25:56,455 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-07-23 05:25:56,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:56,456 INFO L85 PathProgramCache]: Analyzing trace with hash -748325560, now seen corresponding path program 1 times [2022-07-23 05:25:56,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:56,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419135934] [2022-07-23 05:25:56,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:56,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:56,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:56,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419135934] [2022-07-23 05:25:56,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419135934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:56,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:56,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 05:25:56,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290545980] [2022-07-23 05:25:56,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:56,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 05:25:56,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:56,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 05:25:56,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:25:56,563 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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) [2022-07-23 05:25:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:56,811 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2022-07-23 05:25:56,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 05:25:56,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-23 05:25:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:56,812 INFO L225 Difference]: With dead ends: 152 [2022-07-23 05:25:56,812 INFO L226 Difference]: Without dead ends: 152 [2022-07-23 05:25:56,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-07-23 05:25:56,813 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 328 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:56,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 108 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:25:56,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-23 05:25:56,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 112. [2022-07-23 05:25:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 111 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2022-07-23 05:25:56,817 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 19 [2022-07-23 05:25:56,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:56,817 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2022-07-23 05:25:56,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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) [2022-07-23 05:25:56,817 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2022-07-23 05:25:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 05:25:56,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:56,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:56,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 05:25:56,819 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-07-23 05:25:56,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:56,819 INFO L85 PathProgramCache]: Analyzing trace with hash -748325559, now seen corresponding path program 1 times [2022-07-23 05:25:56,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:56,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354737376] [2022-07-23 05:25:56,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:56,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:56,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:56,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354737376] [2022-07-23 05:25:56,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354737376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:56,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:56,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:25:56,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814437594] [2022-07-23 05:25:56,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:56,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:25:56,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:56,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:25:56,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:25:56,908 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) 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) [2022-07-23 05:25:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:57,201 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2022-07-23 05:25:57,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 05:25:57,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) 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 19 [2022-07-23 05:25:57,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:57,202 INFO L225 Difference]: With dead ends: 179 [2022-07-23 05:25:57,202 INFO L226 Difference]: Without dead ends: 179 [2022-07-23 05:25:57,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-23 05:25:57,203 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 252 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:57,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 142 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:25:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-23 05:25:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 114. [2022-07-23 05:25:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 113 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) [2022-07-23 05:25:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2022-07-23 05:25:57,205 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 19 [2022-07-23 05:25:57,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:57,205 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2022-07-23 05:25:57,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) 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) [2022-07-23 05:25:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2022-07-23 05:25:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 05:25:57,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:57,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:57,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 05:25:57,206 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-07-23 05:25:57,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:57,206 INFO L85 PathProgramCache]: Analyzing trace with hash 539074524, now seen corresponding path program 1 times [2022-07-23 05:25:57,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:57,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230171440] [2022-07-23 05:25:57,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:57,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:57,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:57,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230171440] [2022-07-23 05:25:57,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230171440] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:57,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:57,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 05:25:57,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671889898] [2022-07-23 05:25:57,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:57,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 05:25:57,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:57,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 05:25:57,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:25:57,276 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:57,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:57,509 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2022-07-23 05:25:57,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 05:25:57,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-23 05:25:57,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:57,510 INFO L225 Difference]: With dead ends: 120 [2022-07-23 05:25:57,510 INFO L226 Difference]: Without dead ends: 120 [2022-07-23 05:25:57,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-23 05:25:57,511 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 119 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:57,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 126 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:25:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-23 05:25:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2022-07-23 05:25:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.391304347826087) internal successors, (128), 112 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2022-07-23 05:25:57,513 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 20 [2022-07-23 05:25:57,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:57,513 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2022-07-23 05:25:57,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:57,513 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2022-07-23 05:25:57,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 05:25:57,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:57,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:57,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 05:25:57,514 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-07-23 05:25:57,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:57,514 INFO L85 PathProgramCache]: Analyzing trace with hash 539074525, now seen corresponding path program 1 times [2022-07-23 05:25:57,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:57,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313179732] [2022-07-23 05:25:57,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:57,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:25:57,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:57,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313179732] [2022-07-23 05:25:57,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313179732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:57,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:57,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 05:25:57,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732879971] [2022-07-23 05:25:57,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:57,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 05:25:57,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:57,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 05:25:57,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:25:57,600 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:57,833 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2022-07-23 05:25:57,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 05:25:57,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-23 05:25:57,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:57,834 INFO L225 Difference]: With dead ends: 119 [2022-07-23 05:25:57,834 INFO L226 Difference]: Without dead ends: 119 [2022-07-23 05:25:57,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-07-23 05:25:57,835 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 114 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:57,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 123 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:25:57,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-23 05:25:57,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2022-07-23 05:25:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 111 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:57,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2022-07-23 05:25:57,837 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 20 [2022-07-23 05:25:57,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:57,837 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2022-07-23 05:25:57,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:25:57,837 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2022-07-23 05:25:57,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-23 05:25:57,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:57,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:57,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 05:25:57,838 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 46 more)] === [2022-07-23 05:25:57,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:57,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1881321363, now seen corresponding path program 1 times [2022-07-23 05:25:57,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:57,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500605828] [2022-07-23 05:25:57,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:57,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 05:25:57,852 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 05:25:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 05:25:57,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 05:25:57,871 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-23 05:25:57,872 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (48 of 49 remaining) [2022-07-23 05:25:57,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 49 remaining) [2022-07-23 05:25:57,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 49 remaining) [2022-07-23 05:25:57,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 49 remaining) [2022-07-23 05:25:57,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 49 remaining) [2022-07-23 05:25:57,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 49 remaining) [2022-07-23 05:25:57,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 49 remaining) [2022-07-23 05:25:57,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 49 remaining) [2022-07-23 05:25:57,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 49 remaining) [2022-07-23 05:25:57,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 49 remaining) [2022-07-23 05:25:57,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 49 remaining) [2022-07-23 05:25:57,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 49 remaining) [2022-07-23 05:25:57,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 49 remaining) [2022-07-23 05:25:57,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 49 remaining) [2022-07-23 05:25:57,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 49 remaining) [2022-07-23 05:25:57,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 49 remaining) [2022-07-23 05:25:57,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 49 remaining) [2022-07-23 05:25:57,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 49 remaining) [2022-07-23 05:25:57,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 49 remaining) [2022-07-23 05:25:57,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 49 remaining) [2022-07-23 05:25:57,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 49 remaining) [2022-07-23 05:25:57,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 49 remaining) [2022-07-23 05:25:57,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 49 remaining) [2022-07-23 05:25:57,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 49 remaining) [2022-07-23 05:25:57,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 49 remaining) [2022-07-23 05:25:57,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 49 remaining) [2022-07-23 05:25:57,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 49 remaining) [2022-07-23 05:25:57,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 49 remaining) [2022-07-23 05:25:57,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 49 remaining) [2022-07-23 05:25:57,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 49 remaining) [2022-07-23 05:25:57,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 49 remaining) [2022-07-23 05:25:57,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 49 remaining) [2022-07-23 05:25:57,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 49 remaining) [2022-07-23 05:25:57,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 49 remaining) [2022-07-23 05:25:57,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 49 remaining) [2022-07-23 05:25:57,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 49 remaining) [2022-07-23 05:25:57,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 49 remaining) [2022-07-23 05:25:57,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 49 remaining) [2022-07-23 05:25:57,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 49 remaining) [2022-07-23 05:25:57,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 49 remaining) [2022-07-23 05:25:57,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 49 remaining) [2022-07-23 05:25:57,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 49 remaining) [2022-07-23 05:25:57,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 49 remaining) [2022-07-23 05:25:57,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 49 remaining) [2022-07-23 05:25:57,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 49 remaining) [2022-07-23 05:25:57,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (3 of 49 remaining) [2022-07-23 05:25:57,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (2 of 49 remaining) [2022-07-23 05:25:57,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (1 of 49 remaining) [2022-07-23 05:25:57,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK (0 of 49 remaining) [2022-07-23 05:25:57,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 05:25:57,883 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:57,886 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-23 05:25:57,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 05:25:57 BoogieIcfgContainer [2022-07-23 05:25:57,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-23 05:25:57,902 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 05:25:57,903 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 05:25:57,903 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 05:25:57,903 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:25:47" (3/4) ... [2022-07-23 05:25:57,904 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-23 05:25:57,927 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-23 05:25:57,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 05:25:57,928 INFO L158 Benchmark]: Toolchain (without parser) took 11365.40ms. Allocated memory was 109.1MB in the beginning and 180.4MB in the end (delta: 71.3MB). Free memory was 73.3MB in the beginning and 83.9MB in the end (delta: -10.6MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2022-07-23 05:25:57,928 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 109.1MB. Free memory was 80.3MB in the beginning and 80.2MB in the end (delta: 24.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 05:25:57,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.27ms. Allocated memory is still 109.1MB. Free memory was 73.1MB in the beginning and 77.5MB in the end (delta: -4.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 05:25:57,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.89ms. Allocated memory is still 109.1MB. Free memory was 77.5MB in the beginning and 75.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 05:25:57,929 INFO L158 Benchmark]: Boogie Preprocessor took 37.95ms. Allocated memory is still 109.1MB. Free memory was 75.4MB in the beginning and 73.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 05:25:57,929 INFO L158 Benchmark]: RCFGBuilder took 406.83ms. Allocated memory is still 109.1MB. Free memory was 73.9MB in the beginning and 55.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-23 05:25:57,930 INFO L158 Benchmark]: TraceAbstraction took 10446.04ms. Allocated memory was 109.1MB in the beginning and 180.4MB in the end (delta: 71.3MB). Free memory was 54.5MB in the beginning and 86.0MB in the end (delta: -31.5MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2022-07-23 05:25:57,930 INFO L158 Benchmark]: Witness Printer took 25.25ms. Allocated memory is still 180.4MB. Free memory was 86.0MB in the beginning and 83.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 05:25:57,932 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.27ms. Allocated memory is still 109.1MB. Free memory was 80.3MB in the beginning and 80.2MB in the end (delta: 24.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.27ms. Allocated memory is still 109.1MB. Free memory was 73.1MB in the beginning and 77.5MB in the end (delta: -4.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.89ms. Allocated memory is still 109.1MB. Free memory was 77.5MB in the beginning and 75.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.95ms. Allocated memory is still 109.1MB. Free memory was 75.4MB in the beginning and 73.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 406.83ms. Allocated memory is still 109.1MB. Free memory was 73.9MB in the beginning and 55.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10446.04ms. Allocated memory was 109.1MB in the beginning and 180.4MB in the end (delta: 71.3MB). Free memory was 54.5MB in the beginning and 86.0MB in the end (delta: -31.5MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * Witness Printer took 25.25ms. Allocated memory is still 180.4MB. Free memory was 86.0MB in the beginning and 83.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 1053]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L999] SLL* head = malloc(sizeof(SLL)); [L1000] head->next = ((void*)0) VAL [head={-1:0}] [L1001] head->data = 0 VAL [head={-1:0}] [L1003] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1016] COND TRUE __VERIFIER_nondet_int() [L1017] x = malloc(sizeof(SLL)) [L1018] x->data = 1 VAL [head={-1:0}, x={-2:0}] [L1019] x->next = head VAL [head={-1:0}, x={-2:0}] [L1020] head = x VAL [head={-2:0}, x={-2:0}] [L1040] x = head VAL [head={-2:0}, x={-2:0}] [L1043] EXPR x->data VAL [head={-2:0}, x={-2:0}, x->data=1] [L1043] COND FALSE !(x->data != 1) [L1049] EXPR x->next VAL [head={-2:0}, x={-2:0}, x->next={-1:0}] [L1049] x = x->next [L1050] COND TRUE \read(*x) VAL [head={-2:0}, x={-1:0}] [L1052] EXPR x->data VAL [head={-2:0}, x={-1:0}, x->data=0] [L1052] COND TRUE x->data != 1 [L1053] reach_error() VAL [head={-2:0}, x={-1:0}] - 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: -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: -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: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 996]: 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, 107 locations, 49 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2416 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2416 mSDsluCounter, 2388 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 60 IncrementalHoareTripleChecker+Unchecked, 1552 mSDsCounter, 416 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3586 IncrementalHoareTripleChecker+Invalid, 4062 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 416 mSolverCounterUnsat, 836 mSDtfsCounter, 3586 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=13, InterpolantAutomatonStates: 125, 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, 15 MinimizatonAttempts, 330 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 262 ConstructedInterpolants, 14 QuantifiedInterpolants, 2445 SizeOfPredicates, 22 NumberOfNonLiveVariables, 298 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 1/7 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! [2022-07-23 05:25:57,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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-memcleanup)