./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0232-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0232-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1228d922512a0e9364273220ccc1e5afc3bfb7c0e22f10439a1ba902492e71b2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:35:57,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:35:57,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:35:57,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:35:57,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:35:57,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:35:57,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:35:57,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:35:57,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:35:57,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:35:57,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:35:57,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:35:57,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:35:57,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:35:57,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:35:57,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:35:57,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:35:57,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:35:57,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:35:57,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:35:57,327 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:35:57,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:35:57,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:35:57,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:35:57,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:35:57,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:35:57,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:35:57,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:35:57,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:35:57,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:35:57,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:35:57,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:35:57,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:35:57,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:35:57,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:35:57,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:35:57,349 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:35:57,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:35:57,350 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:35:57,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:35:57,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:35:57,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:35:57,354 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:35:57,377 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:35:57,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:35:57,379 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:35:57,379 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:35:57,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:35:57,380 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:35:57,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:35:57,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:35:57,381 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:35:57,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:35:57,382 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:35:57,382 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:35:57,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:35:57,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:35:57,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:35:57,383 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:35:57,383 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:35:57,383 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:35:57,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:35:57,384 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:35:57,384 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:35:57,384 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:35:57,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:35:57,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:35:57,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:35:57,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:35:57,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:35:57,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:35:57,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:35:57,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:35:57,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1228d922512a0e9364273220ccc1e5afc3bfb7c0e22f10439a1ba902492e71b2 [2022-07-12 18:35:57,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:35:57,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:35:57,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:35:57,645 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:35:57,646 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:35:57,647 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-1.i [2022-07-12 18:35:57,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d7c31a00/9cd622547a304c64a0a96ed838cd160d/FLAGf1f48a1d2 [2022-07-12 18:35:58,160 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:35:58,160 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-1.i [2022-07-12 18:35:58,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d7c31a00/9cd622547a304c64a0a96ed838cd160d/FLAGf1f48a1d2 [2022-07-12 18:35:58,505 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d7c31a00/9cd622547a304c64a0a96ed838cd160d [2022-07-12 18:35:58,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:35:58,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:35:58,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:35:58,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:35:58,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:35:58,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:35:58" (1/1) ... [2022-07-12 18:35:58,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34cafad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:58, skipping insertion in model container [2022-07-12 18:35:58,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:35:58" (1/1) ... [2022-07-12 18:35:58,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:35:58,546 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:35:58,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:35:58,832 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:35:58,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:35:58,907 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:35:58,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:58 WrapperNode [2022-07-12 18:35:58,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:35:58,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:35:58,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:35:58,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:35:58,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:58" (1/1) ... [2022-07-12 18:35:58,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:58" (1/1) ... [2022-07-12 18:35:58,968 INFO L137 Inliner]: procedures = 126, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2022-07-12 18:35:58,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:35:58,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:35:58,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:35:58,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:35:58,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:58" (1/1) ... [2022-07-12 18:35:58,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:58" (1/1) ... [2022-07-12 18:35:58,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:58" (1/1) ... [2022-07-12 18:35:58,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:58" (1/1) ... [2022-07-12 18:35:59,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:58" (1/1) ... [2022-07-12 18:35:59,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:58" (1/1) ... [2022-07-12 18:35:59,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:58" (1/1) ... [2022-07-12 18:35:59,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:35:59,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:35:59,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:35:59,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:35:59,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:58" (1/1) ... [2022-07-12 18:35:59,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:35:59,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:35:59,044 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-12 18:35:59,068 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-12 18:35:59,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:35:59,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:35:59,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 18:35:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:35:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:35:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:35:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 18:35:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:35:59,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:35:59,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:35:59,187 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:35:59,188 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:35:59,443 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:35:59,449 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:35:59,449 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 18:35:59,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:35:59 BoogieIcfgContainer [2022-07-12 18:35:59,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:35:59,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:35:59,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:35:59,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:35:59,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:35:58" (1/3) ... [2022-07-12 18:35:59,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1449914a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:35:59, skipping insertion in model container [2022-07-12 18:35:59,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:58" (2/3) ... [2022-07-12 18:35:59,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1449914a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:35:59, skipping insertion in model container [2022-07-12 18:35:59,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:35:59" (3/3) ... [2022-07-12 18:35:59,462 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2022-07-12 18:35:59,476 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:35:59,476 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-07-12 18:35:59,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:35:59,534 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@6d0b27a7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e909f11 [2022-07-12 18:35:59,534 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-07-12 18:35:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 40 states have (on average 2.175) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:35:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 18:35:59,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:59,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 18:35:59,553 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:35:59,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:59,560 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-07-12 18:35:59,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:59,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99130606] [2022-07-12 18:35:59,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:59,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:35:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:35:59,757 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-12 18:35:59,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:35:59,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99130606] [2022-07-12 18:35:59,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99130606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:35:59,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:35:59,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:35:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793313908] [2022-07-12 18:35:59,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:35:59,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:35:59,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:35:59,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:35:59,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:35:59,792 INFO L87 Difference]: Start difference. First operand has 82 states, 40 states have (on average 2.175) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:35:59,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:35:59,931 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-07-12 18:35:59,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:35:59,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-12 18:35:59,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:35:59,940 INFO L225 Difference]: With dead ends: 93 [2022-07-12 18:35:59,940 INFO L226 Difference]: Without dead ends: 91 [2022-07-12 18:35:59,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:35:59,946 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 139 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:35:59,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 52 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:35:59,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-12 18:35:59,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2022-07-12 18:35:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:35:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-07-12 18:35:59,986 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 4 [2022-07-12 18:35:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:35:59,987 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-07-12 18:35:59,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:35:59,987 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-07-12 18:35:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 18:35:59,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:35:59,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 18:35:59,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:35:59,989 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:35:59,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:35:59,990 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-07-12 18:35:59,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:35:59,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687015842] [2022-07-12 18:35:59,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:35:59,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:36:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:00,120 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-12 18:36:00,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:36:00,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687015842] [2022-07-12 18:36:00,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687015842] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:00,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:00,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:36:00,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946759373] [2022-07-12 18:36:00,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:00,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:36:00,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:36:00,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:36:00,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:36:00,124 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:00,245 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-07-12 18:36:00,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:36:00,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-12 18:36:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:00,250 INFO L225 Difference]: With dead ends: 83 [2022-07-12 18:36:00,250 INFO L226 Difference]: Without dead ends: 83 [2022-07-12 18:36:00,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:36:00,255 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 132 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:00,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 34 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:36:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-12 18:36:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2022-07-12 18:36:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-07-12 18:36:00,271 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 4 [2022-07-12 18:36:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:00,272 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-07-12 18:36:00,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:00,272 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-07-12 18:36:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:36:00,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:00,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:36:00,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:36:00,275 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:00,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:00,279 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2022-07-12 18:36:00,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:36:00,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624901726] [2022-07-12 18:36:00,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:00,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:36:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:00,316 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-12 18:36:00,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:36:00,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624901726] [2022-07-12 18:36:00,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624901726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:00,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:00,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:36:00,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911421433] [2022-07-12 18:36:00,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:00,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:36:00,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:36:00,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:36:00,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:36:00,321 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:00,376 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-07-12 18:36:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:36:00,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-12 18:36:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:00,379 INFO L225 Difference]: With dead ends: 79 [2022-07-12 18:36:00,380 INFO L226 Difference]: Without dead ends: 79 [2022-07-12 18:36:00,380 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-12 18:36:00,386 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 48 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:00,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 51 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:36:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-12 18:36:00,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-07-12 18:36:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-07-12 18:36:00,399 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 5 [2022-07-12 18:36:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:00,399 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-07-12 18:36:00,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-07-12 18:36:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:36:00,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:00,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:36:00,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:36:00,401 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:00,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:00,401 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2022-07-12 18:36:00,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:36:00,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700727257] [2022-07-12 18:36:00,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:00,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:36:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:00,451 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-12 18:36:00,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:36:00,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700727257] [2022-07-12 18:36:00,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700727257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:00,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:00,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:36:00,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128107541] [2022-07-12 18:36:00,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:00,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:36:00,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:36:00,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:36:00,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:36:00,454 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:00,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:00,504 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-07-12 18:36:00,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:36:00,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-12 18:36:00,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:00,505 INFO L225 Difference]: With dead ends: 66 [2022-07-12 18:36:00,505 INFO L226 Difference]: Without dead ends: 66 [2022-07-12 18:36:00,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:36:00,510 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:00,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 36 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:36:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-12 18:36:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-07-12 18:36:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 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-12 18:36:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-07-12 18:36:00,524 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 5 [2022-07-12 18:36:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:00,525 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-07-12 18:36:00,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-07-12 18:36:00,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:36:00,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:00,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:36:00,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:36:00,526 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:00,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:00,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2022-07-12 18:36:00,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:36:00,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915007605] [2022-07-12 18:36:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:00,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:36:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:00,640 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-12 18:36:00,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:36:00,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915007605] [2022-07-12 18:36:00,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915007605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:00,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:00,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:36:00,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086761728] [2022-07-12 18:36:00,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:00,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:36:00,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:36:00,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:36:00,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:36:00,643 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:00,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:00,803 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-07-12 18:36:00,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:36:00,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 18:36:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:00,805 INFO L225 Difference]: With dead ends: 76 [2022-07-12 18:36:00,805 INFO L226 Difference]: Without dead ends: 76 [2022-07-12 18:36:00,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:36:00,806 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 14 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:00,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 284 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:36:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-12 18:36:00,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2022-07-12 18:36:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-07-12 18:36:00,811 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 10 [2022-07-12 18:36:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:00,812 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-07-12 18:36:00,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-07-12 18:36:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:36:00,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:00,813 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-12 18:36:00,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:36:00,814 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:00,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2075015976, now seen corresponding path program 1 times [2022-07-12 18:36:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:36:00,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49054644] [2022-07-12 18:36:00,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:00,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:36:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:00,883 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-12 18:36:00,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:36:00,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49054644] [2022-07-12 18:36:00,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49054644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:00,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:00,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:36:00,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789793586] [2022-07-12 18:36:00,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:00,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:36:00,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:36:00,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:36:00,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:36:00,885 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:00,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:00,994 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-07-12 18:36:00,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:36:00,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-12 18:36:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:00,995 INFO L225 Difference]: With dead ends: 79 [2022-07-12 18:36:00,995 INFO L226 Difference]: Without dead ends: 79 [2022-07-12 18:36:00,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:36:00,996 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 97 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:00,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 74 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:36:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-12 18:36:00,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-07-12 18:36:00,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2022-07-12 18:36:01,000 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 18 [2022-07-12 18:36:01,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:01,000 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2022-07-12 18:36:01,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-07-12 18:36:01,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:36:01,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:01,001 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-12 18:36:01,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:36:01,002 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:01,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:01,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2075015977, now seen corresponding path program 1 times [2022-07-12 18:36:01,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:36:01,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231203982] [2022-07-12 18:36:01,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:01,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:36:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:01,107 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-12 18:36:01,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:36:01,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231203982] [2022-07-12 18:36:01,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231203982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:01,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:01,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:36:01,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131522378] [2022-07-12 18:36:01,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:01,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:36:01,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:36:01,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:36:01,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:36:01,111 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:01,228 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-07-12 18:36:01,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:36:01,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-12 18:36:01,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:01,229 INFO L225 Difference]: With dead ends: 81 [2022-07-12 18:36:01,230 INFO L226 Difference]: Without dead ends: 81 [2022-07-12 18:36:01,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:36:01,231 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 167 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:01,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 78 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:36:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-12 18:36:01,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2022-07-12 18:36:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-07-12 18:36:01,234 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 18 [2022-07-12 18:36:01,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:01,234 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-07-12 18:36:01,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-07-12 18:36:01,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:36:01,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:01,236 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-12 18:36:01,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:36:01,236 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:01,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:01,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1245694816, now seen corresponding path program 1 times [2022-07-12 18:36:01,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:36:01,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813464003] [2022-07-12 18:36:01,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:01,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:36:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:01,287 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-12 18:36:01,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:36:01,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813464003] [2022-07-12 18:36:01,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813464003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:01,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:01,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:36:01,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667736887] [2022-07-12 18:36:01,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:01,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:36:01,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:36:01,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:36:01,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:36:01,289 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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-12 18:36:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:01,364 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-07-12 18:36:01,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:36:01,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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-12 18:36:01,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:01,366 INFO L225 Difference]: With dead ends: 63 [2022-07-12 18:36:01,366 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 18:36:01,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-12 18:36:01,367 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 60 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:01,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 91 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:36:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 18:36:01,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-12 18:36:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 62 states have internal predecessors, (65), 0 states have call successors, (0), 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-12 18:36:01,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-07-12 18:36:01,373 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 20 [2022-07-12 18:36:01,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:01,374 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-07-12 18:36:01,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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-12 18:36:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-07-12 18:36:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:36:01,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:01,375 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-12 18:36:01,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:36:01,375 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:01,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:01,376 INFO L85 PathProgramCache]: Analyzing trace with hash -663319495, now seen corresponding path program 1 times [2022-07-12 18:36:01,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:36:01,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416700922] [2022-07-12 18:36:01,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:01,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:36:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:01,433 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-12 18:36:01,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:36:01,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416700922] [2022-07-12 18:36:01,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416700922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:01,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:01,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:36:01,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061158544] [2022-07-12 18:36:01,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:01,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:36:01,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:36:01,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:36:01,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:36:01,435 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:01,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:01,501 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-07-12 18:36:01,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:36:01,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 18:36:01,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:01,502 INFO L225 Difference]: With dead ends: 62 [2022-07-12 18:36:01,502 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 18:36:01,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:36:01,503 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 60 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:01,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 83 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:36:01,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 18:36:01,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-12 18:36:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 61 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:01,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-07-12 18:36:01,505 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 21 [2022-07-12 18:36:01,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:01,506 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-07-12 18:36:01,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:01,506 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-07-12 18:36:01,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:36:01,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:01,507 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, 1] [2022-07-12 18:36:01,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:36:01,507 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:01,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:01,508 INFO L85 PathProgramCache]: Analyzing trace with hash 911932233, now seen corresponding path program 1 times [2022-07-12 18:36:01,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:36:01,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013460507] [2022-07-12 18:36:01,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:01,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:36:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:01,564 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-12 18:36:01,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:36:01,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013460507] [2022-07-12 18:36:01,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013460507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:01,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:01,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:36:01,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161406118] [2022-07-12 18:36:01,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:01,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:36:01,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:36:01,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:36:01,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:36:01,566 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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-12 18:36:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:01,648 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-07-12 18:36:01,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:36:01,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-07-12 18:36:01,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:01,649 INFO L225 Difference]: With dead ends: 61 [2022-07-12 18:36:01,649 INFO L226 Difference]: Without dead ends: 61 [2022-07-12 18:36:01,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:36:01,650 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 53 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:01,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 69 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:36:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-12 18:36:01,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-07-12 18:36:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.4) internal successors, (63), 60 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-07-12 18:36:01,653 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 22 [2022-07-12 18:36:01,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:01,653 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-07-12 18:36:01,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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-12 18:36:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-07-12 18:36:01,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:36:01,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:01,654 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:36:01,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 18:36:01,655 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:01,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:01,655 INFO L85 PathProgramCache]: Analyzing trace with hash -428723026, now seen corresponding path program 1 times [2022-07-12 18:36:01,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:36:01,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974621525] [2022-07-12 18:36:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:36:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:36:01,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:36:01,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974621525] [2022-07-12 18:36:01,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974621525] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:36:01,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614896572] [2022-07-12 18:36:01,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:01,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:36:01,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:36:01,767 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-12 18:36:01,773 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-12 18:36:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:01,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 18:36:01,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:02,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:36:02,144 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 18:36:02,145 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 21 treesize of output 29 [2022-07-12 18:36:02,228 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:36:02,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2022-07-12 18:36:02,288 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:36:02,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2022-07-12 18:36:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:36:02,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:36:02,418 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 38 treesize of output 34 [2022-07-12 18:36:02,696 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:36:02,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 103 treesize of output 255 [2022-07-12 18:36:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:36:02,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614896572] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:36:02,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:36:02,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2022-07-12 18:36:02,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359660439] [2022-07-12 18:36:02,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:36:02,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 18:36:02,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:36:02,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 18:36:02,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:36:02,997 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 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-12 18:36:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:03,392 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2022-07-12 18:36:03,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:36:03,393 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 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 22 [2022-07-12 18:36:03,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:03,394 INFO L225 Difference]: With dead ends: 158 [2022-07-12 18:36:03,394 INFO L226 Difference]: Without dead ends: 158 [2022-07-12 18:36:03,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2022-07-12 18:36:03,395 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 212 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:03,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 396 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 426 Invalid, 0 Unknown, 211 Unchecked, 0.2s Time] [2022-07-12 18:36:03,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-12 18:36:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 75. [2022-07-12 18:36:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 74 states have internal predecessors, (80), 0 states have call successors, (0), 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-12 18:36:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-07-12 18:36:03,397 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2022-07-12 18:36:03,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:03,397 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-07-12 18:36:03,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 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-12 18:36:03,397 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-07-12 18:36:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:36:03,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:03,398 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:36:03,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:36:03,598 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,SelfDestructingSolverStorable10 [2022-07-12 18:36:03,598 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:03,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:03,599 INFO L85 PathProgramCache]: Analyzing trace with hash -428723025, now seen corresponding path program 1 times [2022-07-12 18:36:03,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:36:03,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636770448] [2022-07-12 18:36:03,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:03,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:36:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:36:03,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:36:03,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636770448] [2022-07-12 18:36:03,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636770448] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:36:03,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151929316] [2022-07-12 18:36:03,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:03,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:36:03,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:36:03,792 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-12 18:36:03,793 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-12 18:36:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:03,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-12 18:36:03,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:04,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:36:04,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:36:04,066 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 18:36:04,066 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 15 treesize of output 15 [2022-07-12 18:36:04,072 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 16 treesize of output 18 [2022-07-12 18:36:04,133 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:36:04,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2022-07-12 18:36:04,145 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:36:04,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-07-12 18:36:04,240 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:36:04,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2022-07-12 18:36:04,245 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:36:04,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-07-12 18:36:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:36:04,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:36:04,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-07-12 18:36:04,439 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 66 treesize of output 62 [2022-07-12 18:36:04,442 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 102 treesize of output 94 [2022-07-12 18:36:12,774 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 46 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:36:12,819 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 64 treesize of output 60 [2022-07-12 18:36:12,847 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:36:12,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 106 [2022-07-12 18:36:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:36:12,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151929316] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:36:12,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:36:12,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 22 [2022-07-12 18:36:12,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516499983] [2022-07-12 18:36:12,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:36:12,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 18:36:12,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:36:12,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 18:36:12,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:36:12,980 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:13,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:13,850 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2022-07-12 18:36:13,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 18:36:13,850 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 18:36:13,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:13,851 INFO L225 Difference]: With dead ends: 138 [2022-07-12 18:36:13,851 INFO L226 Difference]: Without dead ends: 138 [2022-07-12 18:36:13,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=254, Invalid=1078, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 18:36:13,852 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 291 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:13,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 410 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 424 Invalid, 0 Unknown, 169 Unchecked, 0.3s Time] [2022-07-12 18:36:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-12 18:36:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 75. [2022-07-12 18:36:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 74 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2022-07-12 18:36:13,854 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 22 [2022-07-12 18:36:13,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:13,855 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2022-07-12 18:36:13,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:13,855 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-07-12 18:36:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:36:13,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:13,856 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, 1, 1] [2022-07-12 18:36:13,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 18:36:14,059 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,SelfDestructingSolverStorable11 [2022-07-12 18:36:14,060 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:14,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:14,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1794871749, now seen corresponding path program 1 times [2022-07-12 18:36:14,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:36:14,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999678804] [2022-07-12 18:36:14,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:14,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:36:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:14,117 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-12 18:36:14,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:36:14,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999678804] [2022-07-12 18:36:14,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999678804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:14,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:14,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:36:14,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509121515] [2022-07-12 18:36:14,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:14,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:36:14,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:36:14,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:36:14,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:36:14,121 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:14,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:14,191 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2022-07-12 18:36:14,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:36:14,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 18:36:14,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:14,192 INFO L225 Difference]: With dead ends: 74 [2022-07-12 18:36:14,192 INFO L226 Difference]: Without dead ends: 74 [2022-07-12 18:36:14,192 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-12 18:36:14,193 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:14,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 120 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:36:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-12 18:36:14,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-07-12 18:36:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 73 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-07-12 18:36:14,197 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 23 [2022-07-12 18:36:14,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:14,197 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-07-12 18:36:14,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:14,197 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-07-12 18:36:14,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:36:14,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:14,199 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, 1, 1, 1] [2022-07-12 18:36:14,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 18:36:14,200 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:14,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:14,200 INFO L85 PathProgramCache]: Analyzing trace with hash 193550732, now seen corresponding path program 1 times [2022-07-12 18:36:14,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:36:14,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724190734] [2022-07-12 18:36:14,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:14,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:36:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:14,293 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-12 18:36:14,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:36:14,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724190734] [2022-07-12 18:36:14,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724190734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:14,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:14,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:36:14,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674482638] [2022-07-12 18:36:14,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:14,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:36:14,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:36:14,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:36:14,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:36:14,297 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:14,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:14,382 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-07-12 18:36:14,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:36:14,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-12 18:36:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:14,383 INFO L225 Difference]: With dead ends: 73 [2022-07-12 18:36:14,383 INFO L226 Difference]: Without dead ends: 73 [2022-07-12 18:36:14,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:36:14,384 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 94 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:14,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 52 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:36:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-12 18:36:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-12 18:36:14,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.305084745762712) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-07-12 18:36:14,387 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 24 [2022-07-12 18:36:14,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:14,387 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-07-12 18:36:14,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-07-12 18:36:14,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:36:14,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:14,389 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, 1, 1, 1] [2022-07-12 18:36:14,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 18:36:14,390 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:14,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:14,390 INFO L85 PathProgramCache]: Analyzing trace with hash 193550733, now seen corresponding path program 1 times [2022-07-12 18:36:14,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:36:14,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723776430] [2022-07-12 18:36:14,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:14,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:36:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:14,463 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-12 18:36:14,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:36:14,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723776430] [2022-07-12 18:36:14,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723776430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:14,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:14,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:36:14,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182933161] [2022-07-12 18:36:14,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:14,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:36:14,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:36:14,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:36:14,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:36:14,465 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:14,497 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-07-12 18:36:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:36:14,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-12 18:36:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:14,498 INFO L225 Difference]: With dead ends: 68 [2022-07-12 18:36:14,498 INFO L226 Difference]: Without dead ends: 68 [2022-07-12 18:36:14,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:36:14,504 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 69 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:14,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 29 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:36:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-12 18:36:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-12 18:36:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-07-12 18:36:14,507 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 24 [2022-07-12 18:36:14,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:14,507 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-07-12 18:36:14,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-07-12 18:36:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:36:14,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:14,512 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:36:14,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:36:14,512 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:14,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:14,513 INFO L85 PathProgramCache]: Analyzing trace with hash 218187410, now seen corresponding path program 1 times [2022-07-12 18:36:14,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:36:14,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707501357] [2022-07-12 18:36:14,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:14,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:36:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:36:14,555 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 18:36:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:36:14,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 18:36:14,598 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 18:36:14,599 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (40 of 41 remaining) [2022-07-12 18:36:14,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 41 remaining) [2022-07-12 18:36:14,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 41 remaining) [2022-07-12 18:36:14,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 41 remaining) [2022-07-12 18:36:14,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 41 remaining) [2022-07-12 18:36:14,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 41 remaining) [2022-07-12 18:36:14,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 41 remaining) [2022-07-12 18:36:14,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 41 remaining) [2022-07-12 18:36:14,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 41 remaining) [2022-07-12 18:36:14,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 41 remaining) [2022-07-12 18:36:14,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 41 remaining) [2022-07-12 18:36:14,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 41 remaining) [2022-07-12 18:36:14,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 41 remaining) [2022-07-12 18:36:14,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 41 remaining) [2022-07-12 18:36:14,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 41 remaining) [2022-07-12 18:36:14,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 41 remaining) [2022-07-12 18:36:14,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 41 remaining) [2022-07-12 18:36:14,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 41 remaining) [2022-07-12 18:36:14,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 41 remaining) [2022-07-12 18:36:14,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 41 remaining) [2022-07-12 18:36:14,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 41 remaining) [2022-07-12 18:36:14,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 41 remaining) [2022-07-12 18:36:14,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 41 remaining) [2022-07-12 18:36:14,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE (17 of 41 remaining) [2022-07-12 18:36:14,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (16 of 41 remaining) [2022-07-12 18:36:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE (15 of 41 remaining) [2022-07-12 18:36:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 41 remaining) [2022-07-12 18:36:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 41 remaining) [2022-07-12 18:36:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 41 remaining) [2022-07-12 18:36:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 41 remaining) [2022-07-12 18:36:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 41 remaining) [2022-07-12 18:36:14,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 41 remaining) [2022-07-12 18:36:14,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 41 remaining) [2022-07-12 18:36:14,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 41 remaining) [2022-07-12 18:36:14,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 41 remaining) [2022-07-12 18:36:14,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 41 remaining) [2022-07-12 18:36:14,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (4 of 41 remaining) [2022-07-12 18:36:14,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (3 of 41 remaining) [2022-07-12 18:36:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (2 of 41 remaining) [2022-07-12 18:36:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 41 remaining) [2022-07-12 18:36:14,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 41 remaining) [2022-07-12 18:36:14,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 18:36:14,611 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:36:14,615 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 18:36:14,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:36:14 BoogieIcfgContainer [2022-07-12 18:36:14,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 18:36:14,639 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 18:36:14,639 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 18:36:14,639 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 18:36:14,640 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:35:59" (3/4) ... [2022-07-12 18:36:14,649 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 18:36:14,649 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 18:36:14,650 INFO L158 Benchmark]: Toolchain (without parser) took 16140.53ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 61.9MB in the beginning and 95.4MB in the end (delta: -33.5MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2022-07-12 18:36:14,650 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 100.7MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:36:14,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.49ms. Allocated memory is still 100.7MB. Free memory was 61.7MB in the beginning and 68.4MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 18:36:14,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.14ms. Allocated memory is still 100.7MB. Free memory was 68.4MB in the beginning and 66.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:36:14,651 INFO L158 Benchmark]: Boogie Preprocessor took 45.61ms. Allocated memory is still 100.7MB. Free memory was 66.4MB in the beginning and 65.0MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 18:36:14,651 INFO L158 Benchmark]: RCFGBuilder took 436.95ms. Allocated memory is still 100.7MB. Free memory was 65.0MB in the beginning and 48.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 18:36:14,651 INFO L158 Benchmark]: TraceAbstraction took 15184.56ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 48.2MB in the beginning and 29.1MB in the end (delta: 19.1MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2022-07-12 18:36:14,652 INFO L158 Benchmark]: Witness Printer took 10.13ms. Allocated memory is still 121.6MB. Free memory was 29.1MB in the beginning and 95.4MB in the end (delta: -66.3MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2022-07-12 18:36:14,653 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.10ms. Allocated memory is still 100.7MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.49ms. Allocated memory is still 100.7MB. Free memory was 61.7MB in the beginning and 68.4MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.14ms. Allocated memory is still 100.7MB. Free memory was 68.4MB in the beginning and 66.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.61ms. Allocated memory is still 100.7MB. Free memory was 66.4MB in the beginning and 65.0MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 436.95ms. Allocated memory is still 100.7MB. Free memory was 65.0MB in the beginning and 48.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15184.56ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 48.2MB in the beginning and 29.1MB in the end (delta: 19.1MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * Witness Printer took 10.13ms. Allocated memory is still 121.6MB. Free memory was 29.1MB in the beginning and 95.4MB in the end (delta: -66.3MB). Peak memory consumption was 4.0MB. 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 - UnprovableResult [Line: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 537. Possible FailurePath: [L539] struct item *list = ((void *)0); VAL [list={6:0}] [L541] CALL append(&list) [L530] struct item *item = malloc(sizeof *item); [L531] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={3:0}, plist={6:0}, plist={6:0}] [L531] item->next = *plist VAL [\read(**plist)={0:0}, item={3:0}, plist={6:0}, plist={6:0}] [L532] EXPR item->next VAL [item={3:0}, item->next={0:0}, plist={6:0}, plist={6:0}] [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, item={3:0}, item->next={0:0}, malloc(sizeof *item)={-1:0}, plist={6:0}, plist={6:0}] [L532-L534] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, item={3:0}, item->next={0:0}, malloc(sizeof *item)={-1:0}, plist={6:0}, plist={6:0}] [L535] *plist = item VAL [item={3:0}, plist={6:0}, plist={6:0}] [L541] RET append(&list) [L542] COND FALSE !(__VERIFIER_nondet_int()) [L543] \read(*list) VAL [\read(*list)={3:0}, list={6:0}] [L543] COND TRUE \read(*list) [L544] EXPR \read(*list) VAL [\read(*list)={3:0}, list={6:0}] [L544] EXPR list->next VAL [\read(*list)={3:0}, list={6:0}, list->next={0:0}] [L544] struct item *next = list->next; [L545] EXPR \read(*list) VAL [\read(*list)={3:0}, list={6:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={3:0}, list={6:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={3:0}, list={6:0}, next={0:0}] [L545] free(list) [L546] list = next VAL [list={6:0}, next={0:0}] [L548] \read(*list) VAL [\read(*list)={0:0}, list={6:0}, next={0:0}] [L548] COND FALSE !(\read(*list)) [L553] return 0; [L539] struct item *list = ((void *)0); [L553] return 0; VAL [\result=0, next={0: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: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free 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: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1497 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1497 mSDsluCounter, 1859 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 380 IncrementalHoareTripleChecker+Unchecked, 1341 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1808 IncrementalHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 518 mSDtfsCounter, 1808 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 107, 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, 212 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 311 ConstructedInterpolants, 22 QuantifiedInterpolants, 3490 SizeOfPredicates, 44 NumberOfNonLiveVariables, 422 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 6/36 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 could not prove your program: unable to determine feasibility of some traces [2022-07-12 18:36:14,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0232-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1228d922512a0e9364273220ccc1e5afc3bfb7c0e22f10439a1ba902492e71b2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:36:16,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:36:16,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:36:16,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:36:16,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:36:16,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:36:16,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:36:16,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:36:16,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:36:16,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:36:16,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:36:16,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:36:16,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:36:16,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:36:16,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:36:16,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:36:16,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:36:16,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:36:16,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:36:16,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:36:16,659 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:36:16,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:36:16,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:36:16,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:36:16,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:36:16,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:36:16,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:36:16,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:36:16,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:36:16,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:36:16,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:36:16,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:36:16,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:36:16,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:36:16,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:36:16,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:36:16,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:36:16,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:36:16,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:36:16,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:36:16,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:36:16,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:36:16,688 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 18:36:16,718 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:36:16,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:36:16,719 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:36:16,719 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:36:16,720 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:36:16,720 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:36:16,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:36:16,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:36:16,721 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:36:16,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:36:16,722 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:36:16,722 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:36:16,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:36:16,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:36:16,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:36:16,723 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:36:16,723 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:36:16,723 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:36:16,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:36:16,724 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:36:16,724 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 18:36:16,724 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 18:36:16,724 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:36:16,725 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:36:16,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:36:16,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:36:16,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:36:16,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:36:16,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:36:16,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:36:16,726 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 18:36:16,726 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 18:36:16,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 18:36:16,726 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1228d922512a0e9364273220ccc1e5afc3bfb7c0e22f10439a1ba902492e71b2 [2022-07-12 18:36:17,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:36:17,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:36:17,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:36:17,062 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:36:17,062 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:36:17,064 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-1.i [2022-07-12 18:36:17,117 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2372365/c3d1dbe65ee9476e9b62249a29348441/FLAGbf007781e [2022-07-12 18:36:17,582 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:36:17,586 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-1.i [2022-07-12 18:36:17,601 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2372365/c3d1dbe65ee9476e9b62249a29348441/FLAGbf007781e [2022-07-12 18:36:17,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2372365/c3d1dbe65ee9476e9b62249a29348441 [2022-07-12 18:36:17,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:36:17,920 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:36:17,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:36:17,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:36:17,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:36:17,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:36:17" (1/1) ... [2022-07-12 18:36:17,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677e0bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:36:17, skipping insertion in model container [2022-07-12 18:36:17,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:36:17" (1/1) ... [2022-07-12 18:36:17,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:36:17,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:36:18,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:36:18,218 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:36:18,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:36:18,276 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:36:18,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:36:18 WrapperNode [2022-07-12 18:36:18,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:36:18,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:36:18,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:36:18,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:36:18,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:36:18" (1/1) ... [2022-07-12 18:36:18,298 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:36:18" (1/1) ... [2022-07-12 18:36:18,315 INFO L137 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2022-07-12 18:36:18,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:36:18,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:36:18,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:36:18,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:36:18,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:36:18" (1/1) ... [2022-07-12 18:36:18,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:36:18" (1/1) ... [2022-07-12 18:36:18,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:36:18" (1/1) ... [2022-07-12 18:36:18,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:36:18" (1/1) ... [2022-07-12 18:36:18,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:36:18" (1/1) ... [2022-07-12 18:36:18,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:36:18" (1/1) ... [2022-07-12 18:36:18,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:36:18" (1/1) ... [2022-07-12 18:36:18,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:36:18,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:36:18,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:36:18,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:36:18,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:36:18" (1/1) ... [2022-07-12 18:36:18,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:36:18,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:36:18,377 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-12 18:36:18,387 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-12 18:36:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:36:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:36:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 18:36:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:36:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:36:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:36:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 18:36:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 18:36:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:36:18,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:36:18,547 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:36:18,548 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:36:18,936 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:36:18,942 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:36:18,942 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 18:36:18,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:36:18 BoogieIcfgContainer [2022-07-12 18:36:18,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:36:18,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:36:18,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:36:18,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:36:18,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:36:17" (1/3) ... [2022-07-12 18:36:18,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@199b895c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:36:18, skipping insertion in model container [2022-07-12 18:36:18,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:36:18" (2/3) ... [2022-07-12 18:36:18,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@199b895c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:36:18, skipping insertion in model container [2022-07-12 18:36:18,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:36:18" (3/3) ... [2022-07-12 18:36:18,950 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2022-07-12 18:36:18,961 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:36:18,961 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-07-12 18:36:18,996 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:36:19,001 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@69bf7d54, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@556d5f5d [2022-07-12 18:36:19,001 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-07-12 18:36:19,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 80 states have internal predecessors, (86), 0 states have call successors, (0), 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-12 18:36:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 18:36:19,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:19,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 18:36:19,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:19,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:19,015 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-07-12 18:36:19,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:19,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183599340] [2022-07-12 18:36:19,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:19,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:19,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:19,031 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:19,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 18:36:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:19,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:36:19,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:19,200 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-12 18:36:19,253 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 18:36:19,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-12 18:36:19,275 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-12 18:36:19,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:36:19,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:36:19,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183599340] [2022-07-12 18:36:19,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183599340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:19,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:19,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:36:19,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230001750] [2022-07-12 18:36:19,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:19,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:36:19,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:36:19,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:36:19,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:36:19,312 INFO L87 Difference]: Start difference. First operand has 81 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 80 states have internal predecessors, (86), 0 states have call successors, (0), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:19,547 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-07-12 18:36:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:36:19,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-12 18:36:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:19,557 INFO L225 Difference]: With dead ends: 92 [2022-07-12 18:36:19,557 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 18:36:19,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:36:19,560 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 137 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:19,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 51 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:36:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 18:36:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 71. [2022-07-12 18:36:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-07-12 18:36:19,592 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 4 [2022-07-12 18:36:19,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:19,593 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-07-12 18:36:19,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:19,593 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-07-12 18:36:19,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 18:36:19,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:19,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 18:36:19,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:36:19,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:19,802 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:19,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:19,803 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-07-12 18:36:19,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:19,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426469362] [2022-07-12 18:36:19,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:19,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:19,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:19,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:19,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 18:36:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:19,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:36:19,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:19,867 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-12 18:36:19,871 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-12 18:36:19,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:36:19,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 18:36:19,919 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:36:19,919 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-12 18:36:19,933 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-12 18:36:19,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:36:19,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:36:19,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426469362] [2022-07-12 18:36:19,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426469362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:19,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:19,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:36:19,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054114108] [2022-07-12 18:36:19,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:19,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:36:19,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:36:19,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:36:19,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:36:19,937 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:20,299 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2022-07-12 18:36:20,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:36:20,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-12 18:36:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:20,301 INFO L225 Difference]: With dead ends: 145 [2022-07-12 18:36:20,301 INFO L226 Difference]: Without dead ends: 145 [2022-07-12 18:36:20,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:36:20,303 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 131 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:20,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 89 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:36:20,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-12 18:36:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 76. [2022-07-12 18:36:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-07-12 18:36:20,315 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 4 [2022-07-12 18:36:20,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:20,316 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-07-12 18:36:20,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-07-12 18:36:20,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:36:20,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:20,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:36:20,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 18:36:20,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:20,532 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:20,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2022-07-12 18:36:20,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:20,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125249002] [2022-07-12 18:36:20,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:20,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:20,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:20,536 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:20,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 18:36:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:20,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:36:20,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:20,592 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-12 18:36:20,598 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-12 18:36:20,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:36:20,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:36:20,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125249002] [2022-07-12 18:36:20,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125249002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:20,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:20,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:36:20,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662089222] [2022-07-12 18:36:20,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:20,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:36:20,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:36:20,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:36:20,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:36:20,603 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:20,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:20,713 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-07-12 18:36:20,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:36:20,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-12 18:36:20,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:20,715 INFO L225 Difference]: With dead ends: 82 [2022-07-12 18:36:20,715 INFO L226 Difference]: Without dead ends: 82 [2022-07-12 18:36:20,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-12 18:36:20,716 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 48 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:20,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 51 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:36:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-12 18:36:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2022-07-12 18:36:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 71 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-07-12 18:36:20,724 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 5 [2022-07-12 18:36:20,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:20,724 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-07-12 18:36:20,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-07-12 18:36:20,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:36:20,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:20,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:36:20,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 18:36:20,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:20,934 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:20,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:20,935 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2022-07-12 18:36:20,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:20,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542634853] [2022-07-12 18:36:20,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:20,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:20,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:20,941 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:20,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 18:36:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:20,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:36:20,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:20,996 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-12 18:36:21,008 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-12 18:36:21,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:36:21,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:36:21,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542634853] [2022-07-12 18:36:21,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542634853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:21,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:21,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:36:21,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055857370] [2022-07-12 18:36:21,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:21,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:36:21,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:36:21,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:36:21,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:36:21,010 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:21,111 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2022-07-12 18:36:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:36:21,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-12 18:36:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:21,113 INFO L225 Difference]: With dead ends: 69 [2022-07-12 18:36:21,113 INFO L226 Difference]: Without dead ends: 69 [2022-07-12 18:36:21,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-12 18:36:21,114 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:21,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 35 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:36:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-12 18:36:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-07-12 18:36:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.574468085106383) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:21,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-07-12 18:36:21,123 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 5 [2022-07-12 18:36:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:21,123 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-07-12 18:36:21,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-07-12 18:36:21,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:36:21,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:21,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:36:21,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:36:21,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:21,333 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:21,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:21,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2022-07-12 18:36:21,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:21,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903045872] [2022-07-12 18:36:21,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:21,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:21,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:21,336 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:21,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 18:36:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:21,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 18:36:21,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:21,530 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:36:21,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-07-12 18:36:21,551 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:36:21,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-07-12 18:36:21,616 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:36:21,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-07-12 18:36:21,643 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:36:21,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-07-12 18:36:21,662 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-12 18:36:21,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:36:21,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:36:21,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903045872] [2022-07-12 18:36:21,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903045872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:21,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:21,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:36:21,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509254439] [2022-07-12 18:36:21,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:21,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:36:21,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:36:21,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:36:21,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:36:21,665 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:21,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:21,847 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-07-12 18:36:21,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:36:21,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 18:36:21,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:21,848 INFO L225 Difference]: With dead ends: 74 [2022-07-12 18:36:21,848 INFO L226 Difference]: Without dead ends: 74 [2022-07-12 18:36:21,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:36:21,850 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:21,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 272 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2022-07-12 18:36:21,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-12 18:36:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-07-12 18:36:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.509433962264151) internal successors, (80), 73 states have internal predecessors, (80), 0 states have call successors, (0), 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-12 18:36:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-07-12 18:36:21,855 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 10 [2022-07-12 18:36:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:21,855 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-07-12 18:36:21,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-07-12 18:36:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:36:21,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:21,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:36:21,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:36:22,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:22,065 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:22,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:22,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1762075788, now seen corresponding path program 1 times [2022-07-12 18:36:22,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:22,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402795732] [2022-07-12 18:36:22,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:22,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:22,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:22,067 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:22,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 18:36:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:22,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:36:22,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:22,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:36:22,214 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-12 18:36:22,226 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:36:22,226 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-12 18:36:22,257 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-12 18:36:22,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:36:22,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:36:22,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402795732] [2022-07-12 18:36:22,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402795732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:22,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:22,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:36:22,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798695374] [2022-07-12 18:36:22,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:22,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:36:22,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:36:22,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:36:22,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:36:22,260 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:22,457 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-07-12 18:36:22,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:36:22,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 18:36:22,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:22,459 INFO L225 Difference]: With dead ends: 82 [2022-07-12 18:36:22,459 INFO L226 Difference]: Without dead ends: 82 [2022-07-12 18:36:22,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:36:22,460 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 138 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:22,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 37 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:36:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-12 18:36:22,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2022-07-12 18:36:22,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2022-07-12 18:36:22,464 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 11 [2022-07-12 18:36:22,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:22,464 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2022-07-12 18:36:22,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:22,465 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-07-12 18:36:22,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:36:22,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:22,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:36:22,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:36:22,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:22,666 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:22,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1870051159, now seen corresponding path program 1 times [2022-07-12 18:36:22,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:22,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972899726] [2022-07-12 18:36:22,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:22,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:22,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:22,668 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:22,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 18:36:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:22,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:36:22,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:22,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:36:22,818 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 17 treesize of output 9 [2022-07-12 18:36:22,825 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-12 18:36:22,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:36:22,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:36:22,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972899726] [2022-07-12 18:36:22,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972899726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:22,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:22,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:36:22,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505592379] [2022-07-12 18:36:22,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:22,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:36:22,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:36:22,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:36:22,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:36:22,828 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-12 18:36:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:23,059 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-07-12 18:36:23,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:36:23,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-12 18:36:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:23,060 INFO L225 Difference]: With dead ends: 78 [2022-07-12 18:36:23,060 INFO L226 Difference]: Without dead ends: 78 [2022-07-12 18:36:23,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:36:23,061 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 133 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:23,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 72 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:36:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-12 18:36:23,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2022-07-12 18:36:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.5) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-07-12 18:36:23,064 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 17 [2022-07-12 18:36:23,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:23,064 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-07-12 18:36:23,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-12 18:36:23,065 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-07-12 18:36:23,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:36:23,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:23,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:36:23,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 18:36:23,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:23,274 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:23,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:23,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1870051160, now seen corresponding path program 1 times [2022-07-12 18:36:23,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:23,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701917425] [2022-07-12 18:36:23,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:23,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:23,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:23,276 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:23,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 18:36:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:23,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 18:36:23,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:23,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:36:23,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:36:23,516 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 17 treesize of output 9 [2022-07-12 18:36:23,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:36:23,539 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-12 18:36:23,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:36:23,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:36:23,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701917425] [2022-07-12 18:36:23,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701917425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:23,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:23,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:36:23,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533352074] [2022-07-12 18:36:23,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:23,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:36:23,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:36:23,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:36:23,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:36:23,541 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-12 18:36:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:23,811 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-07-12 18:36:23,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:36:23,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-12 18:36:23,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:23,812 INFO L225 Difference]: With dead ends: 80 [2022-07-12 18:36:23,812 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 18:36:23,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:36:23,813 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 102 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:23,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 77 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:36:23,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 18:36:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2022-07-12 18:36:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.48) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-07-12 18:36:23,818 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 17 [2022-07-12 18:36:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:23,818 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-07-12 18:36:23,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-12 18:36:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-07-12 18:36:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 18:36:23,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:23,819 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-12 18:36:23,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-12 18:36:24,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:24,029 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:24,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:24,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1843001263, now seen corresponding path program 1 times [2022-07-12 18:36:24,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:24,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138966579] [2022-07-12 18:36:24,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:24,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:24,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:24,031 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:24,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 18:36:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:24,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:36:24,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:24,169 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-12 18:36:24,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 18:36:24,186 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-12 18:36:24,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:36:24,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:36:24,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138966579] [2022-07-12 18:36:24,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138966579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:24,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:24,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:36:24,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9680264] [2022-07-12 18:36:24,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:24,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:36:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:36:24,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:36:24,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:36:24,188 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:24,358 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-07-12 18:36:24,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:36:24,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 18:36:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:24,359 INFO L225 Difference]: With dead ends: 62 [2022-07-12 18:36:24,359 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 18:36:24,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-12 18:36:24,360 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 59 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:24,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 89 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:36:24,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 18:36:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-12 18:36:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 61 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-07-12 18:36:24,364 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 19 [2022-07-12 18:36:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:24,364 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-07-12 18:36:24,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-07-12 18:36:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:36:24,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:24,364 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-12 18:36:24,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 18:36:24,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:24,578 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:24,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:24,578 INFO L85 PathProgramCache]: Analyzing trace with hash 673311177, now seen corresponding path program 1 times [2022-07-12 18:36:24,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:24,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45406879] [2022-07-12 18:36:24,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:24,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:24,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:24,580 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:24,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 18:36:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:24,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:36:24,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:24,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:36:24,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:36:24,746 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-12 18:36:24,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:36:24,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:36:24,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45406879] [2022-07-12 18:36:24,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45406879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:24,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:24,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:36:24,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810303] [2022-07-12 18:36:24,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:24,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:36:24,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:36:24,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:36:24,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:36:24,753 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-12 18:36:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:24,885 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-07-12 18:36:24,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:36:24,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-12 18:36:24,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:24,885 INFO L225 Difference]: With dead ends: 61 [2022-07-12 18:36:24,886 INFO L226 Difference]: Without dead ends: 61 [2022-07-12 18:36:24,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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-12 18:36:24,886 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 59 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:24,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 81 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:36:24,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-12 18:36:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-07-12 18:36:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 60 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-07-12 18:36:24,890 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 20 [2022-07-12 18:36:24,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:24,890 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-07-12 18:36:24,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-12 18:36:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-07-12 18:36:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:36:24,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:24,891 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-12 18:36:24,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 18:36:25,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:25,102 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:25,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:25,103 INFO L85 PathProgramCache]: Analyzing trace with hash -602189896, now seen corresponding path program 1 times [2022-07-12 18:36:25,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:25,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391950912] [2022-07-12 18:36:25,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:25,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:25,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:25,105 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:25,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 18:36:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:25,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:36:25,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:25,297 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-12 18:36:25,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 18:36:25,364 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-12 18:36:25,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:36:25,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:36:25,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391950912] [2022-07-12 18:36:25,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391950912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:25,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:25,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:36:25,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100852659] [2022-07-12 18:36:25,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:25,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:36:25,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:36:25,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:36:25,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:36:25,366 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:25,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:25,593 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-07-12 18:36:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:36:25,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 18:36:25,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:25,594 INFO L225 Difference]: With dead ends: 60 [2022-07-12 18:36:25,594 INFO L226 Difference]: Without dead ends: 60 [2022-07-12 18:36:25,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:36:25,595 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 103 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:25,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 65 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:36:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-12 18:36:25,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-07-12 18:36:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:25,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-07-12 18:36:25,597 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 21 [2022-07-12 18:36:25,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:25,597 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-07-12 18:36:25,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:25,598 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-07-12 18:36:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:36:25,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:25,598 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:36:25,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 18:36:25,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:25,799 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:25,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash 717052317, now seen corresponding path program 1 times [2022-07-12 18:36:25,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:25,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723941032] [2022-07-12 18:36:25,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:25,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:25,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:25,801 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:25,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 18:36:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:25,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 18:36:25,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:25,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:36:25,983 INFO L356 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-07-12 18:36:25,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2022-07-12 18:36:26,043 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:36:26,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-12 18:36:26,120 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:36:26,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2022-07-12 18:36:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:36:26,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:36:26,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-07-12 18:36:26,325 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 18:36:26,325 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 29 treesize of output 26 [2022-07-12 18:36:26,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:36:26,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:36:26,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723941032] [2022-07-12 18:36:26,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723941032] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:36:26,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:36:26,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-07-12 18:36:26,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509219553] [2022-07-12 18:36:26,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:36:26,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:36:26,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:36:26,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:36:26,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:36:26,353 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:26,801 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2022-07-12 18:36:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:36:26,801 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 18:36:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:26,803 INFO L225 Difference]: With dead ends: 108 [2022-07-12 18:36:26,803 INFO L226 Difference]: Without dead ends: 108 [2022-07-12 18:36:26,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:36:26,804 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 114 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:26,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 180 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 238 Invalid, 0 Unknown, 64 Unchecked, 0.4s Time] [2022-07-12 18:36:26,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-12 18:36:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 73. [2022-07-12 18:36:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.368421052631579) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-07-12 18:36:26,807 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 21 [2022-07-12 18:36:26,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:26,807 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-07-12 18:36:26,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-07-12 18:36:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:36:26,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:26,808 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:36:26,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 18:36:27,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:27,017 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash 717052318, now seen corresponding path program 1 times [2022-07-12 18:36:27,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:27,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208676329] [2022-07-12 18:36:27,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:27,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:27,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:27,020 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:27,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 18:36:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:27,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 18:36:27,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:27,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:36:27,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:36:27,266 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 18:36:27,267 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 15 treesize of output 15 [2022-07-12 18:36:27,272 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 16 treesize of output 18 [2022-07-12 18:36:27,350 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:36:27,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2022-07-12 18:36:27,367 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:36:27,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-07-12 18:36:27,463 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:36:27,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2022-07-12 18:36:27,475 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 18:36:27,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-07-12 18:36:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:36:27,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:36:27,927 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 40 treesize of output 32 [2022-07-12 18:36:27,950 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 66 treesize of output 62 [2022-07-12 18:36:27,953 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 102 treesize of output 94 [2022-07-12 18:36:45,211 WARN L233 SmtUtils]: Spent 16.45s on a formula simplification. DAG size of input: 59 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:36:45,373 INFO L356 Elim1Store]: treesize reduction -1, result has 104.0 percent of original size [2022-07-12 18:36:45,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 87 [2022-07-12 18:36:45,402 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:36:45,403 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 133 treesize of output 133 [2022-07-12 18:36:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:36:45,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:36:45,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208676329] [2022-07-12 18:36:45,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208676329] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:36:45,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:36:45,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-07-12 18:36:45,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369606871] [2022-07-12 18:36:45,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:36:45,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 18:36:45,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:36:45,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 18:36:45,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:36:45,589 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 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-12 18:36:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:46,580 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-07-12 18:36:46,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:36:46,583 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 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 21 [2022-07-12 18:36:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:46,583 INFO L225 Difference]: With dead ends: 89 [2022-07-12 18:36:46,583 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 18:36:46,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:36:46,584 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 73 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:46,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 276 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 137 Unchecked, 0.7s Time] [2022-07-12 18:36:46,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 18:36:46,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2022-07-12 18:36:46,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-07-12 18:36:46,590 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 21 [2022-07-12 18:36:46,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:46,590 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-07-12 18:36:46,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 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-12 18:36:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-07-12 18:36:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:36:46,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:46,591 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, 1] [2022-07-12 18:36:46,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 18:36:46,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:46,804 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:46,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:46,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1488017493, now seen corresponding path program 1 times [2022-07-12 18:36:46,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:46,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971920384] [2022-07-12 18:36:46,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:46,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:46,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:46,807 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:46,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 18:36:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:46,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:36:46,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:46,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:36:46,991 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 17 treesize of output 9 [2022-07-12 18:36:47,005 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-12 18:36:47,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:36:47,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:36:47,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971920384] [2022-07-12 18:36:47,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971920384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:47,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:47,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:36:47,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276037462] [2022-07-12 18:36:47,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:47,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:36:47,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:36:47,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:36:47,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:36:47,006 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-12 18:36:47,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:47,282 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-07-12 18:36:47,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:36:47,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-07-12 18:36:47,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:47,283 INFO L225 Difference]: With dead ends: 72 [2022-07-12 18:36:47,283 INFO L226 Difference]: Without dead ends: 72 [2022-07-12 18:36:47,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:36:47,283 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 71 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:47,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 68 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:36:47,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-12 18:36:47,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-12 18:36:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-07-12 18:36:47,286 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 22 [2022-07-12 18:36:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:47,286 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-07-12 18:36:47,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-12 18:36:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-07-12 18:36:47,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:36:47,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:47,287 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, 1, 1] [2022-07-12 18:36:47,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-07-12 18:36:47,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:47,498 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:47,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:47,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1116098075, now seen corresponding path program 1 times [2022-07-12 18:36:47,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:47,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380252049] [2022-07-12 18:36:47,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:47,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:47,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:47,501 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:47,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 18:36:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:47,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 18:36:47,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:47,589 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-12 18:36:47,612 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:36:47,613 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-12 18:36:47,684 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-12 18:36:47,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 18:36:47,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 18:36:47,771 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-12 18:36:47,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:36:47,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:36:47,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380252049] [2022-07-12 18:36:47,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380252049] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:47,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:47,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:36:47,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446068192] [2022-07-12 18:36:47,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:47,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:36:47,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:36:47,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:36:47,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:36:47,773 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:47,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:47,993 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-07-12 18:36:47,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:36:47,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 18:36:47,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:47,994 INFO L225 Difference]: With dead ends: 71 [2022-07-12 18:36:47,994 INFO L226 Difference]: Without dead ends: 71 [2022-07-12 18:36:47,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:36:47,994 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 92 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:47,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 50 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:36:47,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-12 18:36:47,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-12 18:36:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:47,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-07-12 18:36:47,997 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 23 [2022-07-12 18:36:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:47,997 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-07-12 18:36:47,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:47,998 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-07-12 18:36:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:36:47,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:47,998 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, 1, 1] [2022-07-12 18:36:48,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 18:36:48,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:48,206 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:48,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:48,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1116098076, now seen corresponding path program 1 times [2022-07-12 18:36:48,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:48,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574454286] [2022-07-12 18:36:48,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:48,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:48,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:48,209 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:48,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 18:36:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:36:48,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:36:48,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:36:48,401 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-12 18:36:48,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:36:48,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:36:48,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574454286] [2022-07-12 18:36:48,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574454286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:36:48,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:36:48,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:36:48,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091040656] [2022-07-12 18:36:48,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:36:48,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:36:48,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:36:48,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:36:48,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:36:48,403 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:48,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:36:48,527 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-07-12 18:36:48,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:36:48,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 18:36:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:36:48,529 INFO L225 Difference]: With dead ends: 66 [2022-07-12 18:36:48,529 INFO L226 Difference]: Without dead ends: 66 [2022-07-12 18:36:48,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:36:48,530 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 68 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:36:48,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 28 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:36:48,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-12 18:36:48,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-07-12 18:36:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 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-12 18:36:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-07-12 18:36:48,532 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 23 [2022-07-12 18:36:48,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:36:48,532 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-07-12 18:36:48,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:36:48,532 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-07-12 18:36:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:36:48,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:36:48,533 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, 1, 1, 1, 1, 1, 1] [2022-07-12 18:36:48,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 18:36:48,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:48,733 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-12 18:36:48,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:36:48,734 INFO L85 PathProgramCache]: Analyzing trace with hash -599596191, now seen corresponding path program 1 times [2022-07-12 18:36:48,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:36:48,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552821874] [2022-07-12 18:36:48,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:36:48,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:36:48,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:36:48,735 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:36:48,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 18:36:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:36:48,858 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 18:36:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:36:48,973 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-12 18:36:48,973 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 18:36:48,974 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (40 of 41 remaining) [2022-07-12 18:36:48,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 41 remaining) [2022-07-12 18:36:48,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 41 remaining) [2022-07-12 18:36:48,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 41 remaining) [2022-07-12 18:36:48,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 41 remaining) [2022-07-12 18:36:48,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 41 remaining) [2022-07-12 18:36:48,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 41 remaining) [2022-07-12 18:36:48,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 41 remaining) [2022-07-12 18:36:48,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 41 remaining) [2022-07-12 18:36:48,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 41 remaining) [2022-07-12 18:36:48,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 41 remaining) [2022-07-12 18:36:48,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 41 remaining) [2022-07-12 18:36:48,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 41 remaining) [2022-07-12 18:36:48,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 41 remaining) [2022-07-12 18:36:48,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 41 remaining) [2022-07-12 18:36:48,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 41 remaining) [2022-07-12 18:36:48,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 41 remaining) [2022-07-12 18:36:48,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 41 remaining) [2022-07-12 18:36:48,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 41 remaining) [2022-07-12 18:36:48,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 41 remaining) [2022-07-12 18:36:48,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 41 remaining) [2022-07-12 18:36:48,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 41 remaining) [2022-07-12 18:36:48,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 41 remaining) [2022-07-12 18:36:48,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE (17 of 41 remaining) [2022-07-12 18:36:48,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (16 of 41 remaining) [2022-07-12 18:36:48,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE (15 of 41 remaining) [2022-07-12 18:36:48,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 41 remaining) [2022-07-12 18:36:48,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 41 remaining) [2022-07-12 18:36:48,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 41 remaining) [2022-07-12 18:36:48,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 41 remaining) [2022-07-12 18:36:48,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 41 remaining) [2022-07-12 18:36:48,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 41 remaining) [2022-07-12 18:36:48,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 41 remaining) [2022-07-12 18:36:48,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 41 remaining) [2022-07-12 18:36:48,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 41 remaining) [2022-07-12 18:36:48,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 41 remaining) [2022-07-12 18:36:48,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (4 of 41 remaining) [2022-07-12 18:36:48,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (3 of 41 remaining) [2022-07-12 18:36:48,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (2 of 41 remaining) [2022-07-12 18:36:48,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 41 remaining) [2022-07-12 18:36:48,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 41 remaining) [2022-07-12 18:36:49,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-12 18:36:49,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:36:49,205 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:36:49,207 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 18:36:49,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:36:49 BoogieIcfgContainer [2022-07-12 18:36:49,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 18:36:49,243 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 18:36:49,243 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 18:36:49,243 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 18:36:49,247 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:36:18" (3/4) ... [2022-07-12 18:36:49,249 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 18:36:49,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 18:36:49,250 INFO L158 Benchmark]: Toolchain (without parser) took 31329.92ms. Allocated memory was 54.5MB in the beginning and 100.7MB in the end (delta: 46.1MB). Free memory was 30.2MB in the beginning and 54.4MB in the end (delta: -24.3MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2022-07-12 18:36:49,250 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory was 36.6MB in the beginning and 36.5MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:36:49,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.90ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 30.0MB in the beginning and 45.1MB in the end (delta: -15.1MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2022-07-12 18:36:49,251 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.37ms. Allocated memory is still 69.2MB. Free memory was 45.1MB in the beginning and 43.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:36:49,251 INFO L158 Benchmark]: Boogie Preprocessor took 27.24ms. Allocated memory is still 69.2MB. Free memory was 43.0MB in the beginning and 41.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:36:49,251 INFO L158 Benchmark]: RCFGBuilder took 598.86ms. Allocated memory is still 69.2MB. Free memory was 41.4MB in the beginning and 37.5MB in the end (delta: 3.8MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2022-07-12 18:36:49,251 INFO L158 Benchmark]: TraceAbstraction took 30297.94ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 37.0MB in the beginning and 55.4MB in the end (delta: -18.5MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2022-07-12 18:36:49,251 INFO L158 Benchmark]: Witness Printer took 6.32ms. Allocated memory is still 100.7MB. Free memory was 55.4MB in the beginning and 54.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:36:49,253 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.17ms. Allocated memory is still 54.5MB. Free memory was 36.6MB in the beginning and 36.5MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.90ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 30.0MB in the beginning and 45.1MB in the end (delta: -15.1MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.37ms. Allocated memory is still 69.2MB. Free memory was 45.1MB in the beginning and 43.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.24ms. Allocated memory is still 69.2MB. Free memory was 43.0MB in the beginning and 41.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 598.86ms. Allocated memory is still 69.2MB. Free memory was 41.4MB in the beginning and 37.5MB in the end (delta: 3.8MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * TraceAbstraction took 30297.94ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 37.0MB in the beginning and 55.4MB in the end (delta: -18.5MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Witness Printer took 6.32ms. Allocated memory is still 100.7MB. Free memory was 55.4MB in the beginning and 54.4MB in the end (delta: 1.0MB). There was no memory consumed. 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 - UnprovableResult [Line: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 537. Possible FailurePath: [L539] struct item *list = ((void *)0); VAL [list={10:0}] [L541] CALL append(&list) [L530] struct item *item = malloc(sizeof *item); [L531] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={3:0}, plist={10:0}, plist={10:0}] [L531] item->next = *plist VAL [\read(**plist)={0:0}, item={3:0}, plist={10:0}, plist={10:0}] [L532] EXPR item->next VAL [item={3:0}, item->next={0:0}, plist={10:0}, plist={10:0}] [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={7:0}, item={3:0}, item->next={0:0}, malloc(sizeof *item)={7:0}, plist={10:0}, plist={10:0}] [L532-L534] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={7:0}, item={3:0}, item->next={0:0}, malloc(sizeof *item)={7:0}, plist={10:0}, plist={10:0}] [L535] *plist = item VAL [item={3:0}, plist={10:0}, plist={10:0}] [L541] RET append(&list) [L542] COND FALSE !(__VERIFIER_nondet_int()) [L543] \read(*list) VAL [\read(*list)={3:0}, list={10:0}] [L543] COND TRUE \read(*list) [L544] EXPR \read(*list) VAL [\read(*list)={3:0}, list={10:0}] [L544] EXPR list->next VAL [\read(*list)={3:0}, list={10:0}, list->next={0:0}] [L544] struct item *next = list->next; [L545] EXPR \read(*list) VAL [\read(*list)={3:0}, list={10:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={3:0}, list={10:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={3:0}, list={10:0}, next={0:0}] [L545] free(list) [L546] list = next VAL [list={10:0}, next={0:0}] [L548] \read(*list) VAL [\read(*list)={0:0}, list={10:0}, next={0:0}] [L548] COND FALSE !(\read(*list)) [L553] return 0; [L539] struct item *list = ((void *)0); [L553] return 0; VAL [\result=0, next={0: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: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free 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: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 81 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 30.2s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1390 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1390 mSDsluCounter, 1521 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 246 IncrementalHoareTripleChecker+Unchecked, 971 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1502 IncrementalHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 550 mSDtfsCounter, 1502 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 18.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 92, 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, 16 MinimizatonAttempts, 183 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 267 ConstructedInterpolants, 20 QuantifiedInterpolants, 3144 SizeOfPredicates, 121 NumberOfNonLiveVariables, 1643 ConjunctsInSsa, 185 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 4/24 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 could not prove your program: unable to determine feasibility of some traces [2022-07-12 18:36:49,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample