./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/list-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list-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 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:20:49,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:20:50,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:20:50,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:20:50,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:20:50,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:20:50,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:20:50,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:20:50,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:20:50,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:20:50,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:20:50,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:20:50,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:20:50,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:20:50,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:20:50,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:20:50,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:20:50,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:20:50,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:20:50,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:20:50,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:20:50,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:20:50,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:20:50,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:20:50,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:20:50,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:20:50,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:20:50,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:20:50,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:20:50,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:20:50,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:20:50,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:20:50,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:20:50,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:20:50,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:20:50,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:20:50,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:20:50,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:20:50,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:20:50,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:20:50,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:20:50,119 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:20:50,147 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:20:50,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:20:50,148 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:20:50,148 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:20:50,149 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:20:50,149 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:20:50,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:20:50,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:20:50,150 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:20:50,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:20:50,151 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:20:50,151 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:20:50,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:20:50,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:20:50,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:20:50,152 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:20:50,152 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:20:50,152 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:20:50,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:20:50,153 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:20:50,153 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:20:50,153 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:20:50,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:20:50,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:20:50,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:20:50,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:20:50,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:20:50,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:20:50,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:20:50,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:20:50,155 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:20:50,155 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:20:50,155 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:20:50,155 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:20:50,156 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 [2023-02-15 22:20:50,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:20:50,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:20:50,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:20:50,406 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:20:50,406 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:20:50,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-1.i [2023-02-15 22:20:51,546 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:20:51,730 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:20:51,731 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i [2023-02-15 22:20:51,741 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bf9f4217/a0ff132879df4f749a11af0311f7830b/FLAGa71b37d5f [2023-02-15 22:20:51,753 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bf9f4217/a0ff132879df4f749a11af0311f7830b [2023-02-15 22:20:51,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:20:51,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:20:51,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:20:51,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:20:51,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:20:51,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:20:51" (1/1) ... [2023-02-15 22:20:51,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54fe499a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:51, skipping insertion in model container [2023-02-15 22:20:51,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:20:51" (1/1) ... [2023-02-15 22:20:51,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:20:51,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:20:52,149 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i[23408,23421] [2023-02-15 22:20:52,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:20:52,165 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:20:52,208 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i[23408,23421] [2023-02-15 22:20:52,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:20:52,237 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:20:52,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:52 WrapperNode [2023-02-15 22:20:52,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:20:52,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:20:52,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:20:52,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:20:52,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:52" (1/1) ... [2023-02-15 22:20:52,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:52" (1/1) ... [2023-02-15 22:20:52,279 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2023-02-15 22:20:52,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:20:52,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:20:52,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:20:52,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:20:52,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:52" (1/1) ... [2023-02-15 22:20:52,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:52" (1/1) ... [2023-02-15 22:20:52,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:52" (1/1) ... [2023-02-15 22:20:52,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:52" (1/1) ... [2023-02-15 22:20:52,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:52" (1/1) ... [2023-02-15 22:20:52,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:52" (1/1) ... [2023-02-15 22:20:52,323 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:52" (1/1) ... [2023-02-15 22:20:52,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:52" (1/1) ... [2023-02-15 22:20:52,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:20:52,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:20:52,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:20:52,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:20:52,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:52" (1/1) ... [2023-02-15 22:20:52,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:20:52,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:20:52,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 22:20:52,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 22:20:52,408 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 22:20:52,408 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 22:20:52,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:20:52,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:20:52,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:20:52,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:20:52,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:20:52,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:20:52,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:20:52,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:20:52,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:20:52,539 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:20:52,541 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:20:52,576 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 22:20:52,739 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:20:52,745 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:20:52,745 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 22:20:52,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:20:52 BoogieIcfgContainer [2023-02-15 22:20:52,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:20:52,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:20:52,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:20:52,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:20:52,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:20:51" (1/3) ... [2023-02-15 22:20:52,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cef9bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:20:52, skipping insertion in model container [2023-02-15 22:20:52,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:52" (2/3) ... [2023-02-15 22:20:52,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cef9bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:20:52, skipping insertion in model container [2023-02-15 22:20:52,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:20:52" (3/3) ... [2023-02-15 22:20:52,755 INFO L112 eAbstractionObserver]: Analyzing ICFG list-1.i [2023-02-15 22:20:52,769 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:20:52,772 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-02-15 22:20:52,813 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:20:52,818 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@27eda1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:20:52,818 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-02-15 22:20:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 38 states have (on average 2.0) internal successors, (76), 66 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:52,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 22:20:52,828 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:20:52,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:20:52,829 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:20:52,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:20:52,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238161, now seen corresponding path program 1 times [2023-02-15 22:20:52,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:20:52,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943140687] [2023-02-15 22:20:52,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:52,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:20:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:53,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:20:53,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943140687] [2023-02-15 22:20:53,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943140687] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:20:53,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:20:53,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:20:53,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404501714] [2023-02-15 22:20:53,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:20:53,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:20:53,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:20:53,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:20:53,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:20:53,125 INFO L87 Difference]: Start difference. First operand has 68 states, 38 states have (on average 2.0) internal successors, (76), 66 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 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 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:20:53,319 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2023-02-15 22:20:53,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:20:53,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-15 22:20:53,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:20:53,326 INFO L225 Difference]: With dead ends: 75 [2023-02-15 22:20:53,340 INFO L226 Difference]: Without dead ends: 68 [2023-02-15 22:20:53,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:20:53,345 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 116 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:20:53,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 40 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:20:53,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-02-15 22:20:53,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2023-02-15 22:20:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 62 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2023-02-15 22:20:53,403 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 7 [2023-02-15 22:20:53,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:20:53,403 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2023-02-15 22:20:53,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2023-02-15 22:20:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 22:20:53,404 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:20:53,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:20:53,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:20:53,405 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:20:53,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:20:53,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238162, now seen corresponding path program 1 times [2023-02-15 22:20:53,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:20:53,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026507155] [2023-02-15 22:20:53,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:53,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:20:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:53,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:20:53,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026507155] [2023-02-15 22:20:53,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026507155] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:20:53,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:20:53,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:20:53,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485669729] [2023-02-15 22:20:53,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:20:53,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:20:53,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:20:53,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:20:53,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:20:53,539 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:53,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:20:53,720 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2023-02-15 22:20:53,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:20:53,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-15 22:20:53,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:20:53,725 INFO L225 Difference]: With dead ends: 88 [2023-02-15 22:20:53,726 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 22:20:53,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:20:53,733 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 113 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:20:53,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 45 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:20:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 22:20:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2023-02-15 22:20:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 76 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2023-02-15 22:20:53,758 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 7 [2023-02-15 22:20:53,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:20:53,759 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2023-02-15 22:20:53,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2023-02-15 22:20:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:20:53,761 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:20:53,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:20:53,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:20:53,762 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:20:53,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:20:53,764 INFO L85 PathProgramCache]: Analyzing trace with hash -502587362, now seen corresponding path program 1 times [2023-02-15 22:20:53,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:20:53,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827574842] [2023-02-15 22:20:53,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:53,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:20:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:53,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:20:53,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827574842] [2023-02-15 22:20:53,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827574842] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:20:53,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:20:53,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:20:53,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025967978] [2023-02-15 22:20:53,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:20:53,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:20:53,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:20:53,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:20:53,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:20:53,942 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:54,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:20:54,112 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2023-02-15 22:20:54,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:20:54,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 22:20:54,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:20:54,118 INFO L225 Difference]: With dead ends: 129 [2023-02-15 22:20:54,118 INFO L226 Difference]: Without dead ends: 129 [2023-02-15 22:20:54,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:20:54,126 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 106 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:20:54,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 172 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:20:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-15 22:20:54,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 84. [2023-02-15 22:20:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 83 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2023-02-15 22:20:54,137 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 15 [2023-02-15 22:20:54,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:20:54,137 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2023-02-15 22:20:54,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2023-02-15 22:20:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:20:54,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:20:54,139 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:20:54,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:20:54,139 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:20:54,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:20:54,143 INFO L85 PathProgramCache]: Analyzing trace with hash 761251652, now seen corresponding path program 1 times [2023-02-15 22:20:54,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:20:54,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944196729] [2023-02-15 22:20:54,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:54,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:20:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:54,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:20:54,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944196729] [2023-02-15 22:20:54,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944196729] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:20:54,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:20:54,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:20:54,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297372753] [2023-02-15 22:20:54,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:20:54,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:20:54,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:20:54,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:20:54,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:20:54,265 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:20:54,428 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2023-02-15 22:20:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:20:54,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 22:20:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:20:54,430 INFO L225 Difference]: With dead ends: 112 [2023-02-15 22:20:54,430 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 22:20:54,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:20:54,438 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 88 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:20:54,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 151 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:20:54,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 22:20:54,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 87. [2023-02-15 22:20:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.463768115942029) internal successors, (101), 86 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2023-02-15 22:20:54,456 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 15 [2023-02-15 22:20:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:20:54,457 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2023-02-15 22:20:54,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2023-02-15 22:20:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:20:54,458 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:20:54,459 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:20:54,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:20:54,459 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:20:54,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:20:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash 761251653, now seen corresponding path program 1 times [2023-02-15 22:20:54,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:20:54,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538218714] [2023-02-15 22:20:54,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:54,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:20:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:54,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:20:54,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538218714] [2023-02-15 22:20:54,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538218714] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:20:54,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:20:54,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:20:54,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894127983] [2023-02-15 22:20:54,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:20:54,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:20:54,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:20:54,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:20:54,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:20:54,651 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:20:54,863 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2023-02-15 22:20:54,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:20:54,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 22:20:54,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:20:54,864 INFO L225 Difference]: With dead ends: 113 [2023-02-15 22:20:54,864 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 22:20:54,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:20:54,865 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 62 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:20:54,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 186 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:20:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 22:20:54,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 83. [2023-02-15 22:20:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 82 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2023-02-15 22:20:54,869 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 15 [2023-02-15 22:20:54,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:20:54,869 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2023-02-15 22:20:54,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2023-02-15 22:20:54,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:20:54,870 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:20:54,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:20:54,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:20:54,870 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:20:54,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:20:54,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1997748640, now seen corresponding path program 1 times [2023-02-15 22:20:54,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:20:54,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073034886] [2023-02-15 22:20:54,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:54,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:20:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:54,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:20:54,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073034886] [2023-02-15 22:20:54,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073034886] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:20:54,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:20:54,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:20:54,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501994707] [2023-02-15 22:20:54,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:20:54,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:20:54,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:20:54,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:20:54,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:20:54,966 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) 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) [2023-02-15 22:20:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:20:55,065 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2023-02-15 22:20:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:20:55,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) 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 [2023-02-15 22:20:55,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:20:55,067 INFO L225 Difference]: With dead ends: 124 [2023-02-15 22:20:55,067 INFO L226 Difference]: Without dead ends: 124 [2023-02-15 22:20:55,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:20:55,068 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 70 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:20:55,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 162 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:20:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-15 22:20:55,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 90. [2023-02-15 22:20:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2023-02-15 22:20:55,076 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 17 [2023-02-15 22:20:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:20:55,077 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2023-02-15 22:20:55,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) 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) [2023-02-15 22:20:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2023-02-15 22:20:55,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:20:55,081 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:20:55,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:20:55,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 22:20:55,082 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:20:55,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:20:55,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1997696085, now seen corresponding path program 1 times [2023-02-15 22:20:55,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:20:55,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063216221] [2023-02-15 22:20:55,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:55,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:20:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:55,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:20:55,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063216221] [2023-02-15 22:20:55,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063216221] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:20:55,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:20:55,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:20:55,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266969103] [2023-02-15 22:20:55,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:20:55,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:20:55,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:20:55,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:20:55,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:20:55,203 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) 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) [2023-02-15 22:20:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:20:55,338 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2023-02-15 22:20:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:20:55,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) 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 [2023-02-15 22:20:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:20:55,339 INFO L225 Difference]: With dead ends: 151 [2023-02-15 22:20:55,339 INFO L226 Difference]: Without dead ends: 151 [2023-02-15 22:20:55,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:20:55,340 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 105 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:20:55,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 204 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:20:55,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-15 22:20:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 106. [2023-02-15 22:20:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 105 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2023-02-15 22:20:55,345 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 17 [2023-02-15 22:20:55,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:20:55,345 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2023-02-15 22:20:55,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) 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) [2023-02-15 22:20:55,346 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2023-02-15 22:20:55,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:20:55,346 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:20:55,347 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:20:55,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 22:20:55,347 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:20:55,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:20:55,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2001456982, now seen corresponding path program 1 times [2023-02-15 22:20:55,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:20:55,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645509928] [2023-02-15 22:20:55,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:55,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:20:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:55,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:20:55,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645509928] [2023-02-15 22:20:55,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645509928] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:20:55,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:20:55,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:20:55,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430470497] [2023-02-15 22:20:55,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:20:55,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:20:55,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:20:55,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:20:55,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:20:55,423 INFO L87 Difference]: Start difference. First operand 106 states and 121 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) [2023-02-15 22:20:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:20:55,537 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2023-02-15 22:20:55,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:20:55,537 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 [2023-02-15 22:20:55,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:20:55,538 INFO L225 Difference]: With dead ends: 108 [2023-02-15 22:20:55,538 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 22:20:55,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:20:55,539 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 81 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:20:55,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 122 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:20:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 22:20:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2023-02-15 22:20:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 103 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2023-02-15 22:20:55,543 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 17 [2023-02-15 22:20:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:20:55,543 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2023-02-15 22:20:55,544 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) [2023-02-15 22:20:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2023-02-15 22:20:55,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:20:55,544 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:20:55,545 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:20:55,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 22:20:55,545 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:20:55,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:20:55,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2001456983, now seen corresponding path program 1 times [2023-02-15 22:20:55,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:20:55,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996157929] [2023-02-15 22:20:55,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:55,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:20:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:55,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:20:55,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996157929] [2023-02-15 22:20:55,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996157929] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:20:55,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:20:55,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:20:55,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306331681] [2023-02-15 22:20:55,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:20:55,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:20:55,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:20:55,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:20:55,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:20:55,682 INFO L87 Difference]: Start difference. First operand 104 states and 118 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) [2023-02-15 22:20:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:20:55,845 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2023-02-15 22:20:55,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:20:55,845 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 [2023-02-15 22:20:55,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:20:55,846 INFO L225 Difference]: With dead ends: 105 [2023-02-15 22:20:55,846 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 22:20:55,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:20:55,847 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 54 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:20:55,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 147 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:20:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 22:20:55,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2023-02-15 22:20:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 91 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:20:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2023-02-15 22:20:55,850 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 17 [2023-02-15 22:20:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:20:55,850 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2023-02-15 22:20:55,850 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) [2023-02-15 22:20:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2023-02-15 22:20:55,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 22:20:55,851 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:20:55,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:20:55,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 22:20:55,851 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:20:55,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:20:55,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1800660604, now seen corresponding path program 1 times [2023-02-15 22:20:55,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:20:55,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952887926] [2023-02-15 22:20:55,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:55,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:20:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:20:55,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 22:20:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:20:55,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 22:20:55,881 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 22:20:55,882 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2023-02-15 22:20:55,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2023-02-15 22:20:55,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2023-02-15 22:20:55,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2023-02-15 22:20:55,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2023-02-15 22:20:55,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2023-02-15 22:20:55,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2023-02-15 22:20:55,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2023-02-15 22:20:55,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2023-02-15 22:20:55,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2023-02-15 22:20:55,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2023-02-15 22:20:55,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2023-02-15 22:20:55,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2023-02-15 22:20:55,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2023-02-15 22:20:55,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2023-02-15 22:20:55,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2023-02-15 22:20:55,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2023-02-15 22:20:55,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2023-02-15 22:20:55,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2023-02-15 22:20:55,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2023-02-15 22:20:55,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2023-02-15 22:20:55,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2023-02-15 22:20:55,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2023-02-15 22:20:55,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2023-02-15 22:20:55,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2023-02-15 22:20:55,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (0 of 26 remaining) [2023-02-15 22:20:55,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 22:20:55,891 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:20:55,894 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 22:20:55,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:20:55 BoogieIcfgContainer [2023-02-15 22:20:55,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 22:20:55,912 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 22:20:55,912 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 22:20:55,912 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 22:20:55,913 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:20:52" (3/4) ... [2023-02-15 22:20:55,915 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 22:20:55,915 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 22:20:55,916 INFO L158 Benchmark]: Toolchain (without parser) took 4159.94ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 130.9MB in the beginning and 108.0MB in the end (delta: 22.9MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2023-02-15 22:20:55,916 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 123.7MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:20:55,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.43ms. Allocated memory is still 169.9MB. Free memory was 130.4MB in the beginning and 128.3MB in the end (delta: 2.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-15 22:20:55,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.67ms. Allocated memory is still 169.9MB. Free memory was 128.3MB in the beginning and 126.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:20:55,917 INFO L158 Benchmark]: Boogie Preprocessor took 52.70ms. Allocated memory is still 169.9MB. Free memory was 126.8MB in the beginning and 125.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:20:55,917 INFO L158 Benchmark]: RCFGBuilder took 413.67ms. Allocated memory is still 169.9MB. Free memory was 125.2MB in the beginning and 107.9MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 22:20:55,918 INFO L158 Benchmark]: TraceAbstraction took 3162.44ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 107.4MB in the beginning and 108.0MB in the end (delta: -664.8kB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2023-02-15 22:20:55,918 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 205.5MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:20:55,920 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 123.7MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.43ms. Allocated memory is still 169.9MB. Free memory was 130.4MB in the beginning and 128.3MB in the end (delta: 2.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.67ms. Allocated memory is still 169.9MB. Free memory was 128.3MB in the beginning and 126.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.70ms. Allocated memory is still 169.9MB. Free memory was 126.8MB in the beginning and 125.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 413.67ms. Allocated memory is still 169.9MB. Free memory was 125.2MB in the beginning and 107.9MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3162.44ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 107.4MB in the beginning and 108.0MB in the end (delta: -664.8kB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 205.5MB. Free memory is still 108.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: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={-1:0}] [L534] List t; [L535] List p = a; VAL [a={-1:0}, p={-1:0}] [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 VAL [a={-1:0}, p={-1:0}] [L551] p = a VAL [a={-1:0}, p={-1:0}] [L552] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=3] [L552] COND FALSE !(p->h == 1) [L554] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=3] [L554] COND FALSE !(p->h == 2) [L556] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=3] [L556] COND FALSE !(p->h != 3) [L558] return 0; VAL [\result=0, a={-1:0}, p={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 795 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 795 mSDsluCounter, 1229 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 837 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1173 IncrementalHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 392 mSDtfsCounter, 1173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=7, InterpolantAutomatonStates: 61, 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, 9 MinimizatonAttempts, 212 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 12/12 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 [2023-02-15 22:20:55,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/list-properties/list-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 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:20:57,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:20:57,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:20:58,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:20:58,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:20:58,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:20:58,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:20:58,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:20:58,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:20:58,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:20:58,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:20:58,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:20:58,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:20:58,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:20:58,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:20:58,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:20:58,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:20:58,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:20:58,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:20:58,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:20:58,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:20:58,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:20:58,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:20:58,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:20:58,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:20:58,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:20:58,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:20:58,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:20:58,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:20:58,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:20:58,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:20:58,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:20:58,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:20:58,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:20:58,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:20:58,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:20:58,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:20:58,066 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:20:58,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:20:58,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:20:58,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:20:58,068 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 22:20:58,101 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:20:58,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:20:58,102 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:20:58,102 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:20:58,102 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:20:58,102 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:20:58,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:20:58,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:20:58,103 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:20:58,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:20:58,103 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:20:58,103 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:20:58,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:20:58,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:20:58,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:20:58,104 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:20:58,104 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:20:58,104 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:20:58,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:20:58,104 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:20:58,105 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 22:20:58,105 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 22:20:58,105 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:20:58,105 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:20:58,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:20:58,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:20:58,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:20:58,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:20:58,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:20:58,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:20:58,107 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 22:20:58,107 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 22:20:58,107 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:20:58,107 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:20:58,107 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:20:58,108 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 22:20:58,108 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:20:58,108 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 [2023-02-15 22:20:58,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:20:58,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:20:58,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:20:58,424 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:20:58,425 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:20:58,426 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-1.i [2023-02-15 22:20:59,729 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:20:59,985 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:20:59,986 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i [2023-02-15 22:21:00,003 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d2b2f698/268e0545fe8241a8a3273753867bff82/FLAGab3ec280a [2023-02-15 22:21:00,022 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d2b2f698/268e0545fe8241a8a3273753867bff82 [2023-02-15 22:21:00,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:21:00,027 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:21:00,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:21:00,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:21:00,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:21:00,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:21:00" (1/1) ... [2023-02-15 22:21:00,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ab3f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:00, skipping insertion in model container [2023-02-15 22:21:00,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:21:00" (1/1) ... [2023-02-15 22:21:00,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:21:00,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:21:00,321 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i[23408,23421] [2023-02-15 22:21:00,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:21:00,342 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:21:00,412 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i[23408,23421] [2023-02-15 22:21:00,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:21:00,447 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:21:00,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:00 WrapperNode [2023-02-15 22:21:00,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:21:00,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:21:00,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:21:00,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:21:00,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:00" (1/1) ... [2023-02-15 22:21:00,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:00" (1/1) ... [2023-02-15 22:21:00,495 INFO L138 Inliner]: procedures = 127, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2023-02-15 22:21:00,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:21:00,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:21:00,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:21:00,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:21:00,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:00" (1/1) ... [2023-02-15 22:21:00,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:00" (1/1) ... [2023-02-15 22:21:00,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:00" (1/1) ... [2023-02-15 22:21:00,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:00" (1/1) ... [2023-02-15 22:21:00,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:00" (1/1) ... [2023-02-15 22:21:00,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:00" (1/1) ... [2023-02-15 22:21:00,543 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:00" (1/1) ... [2023-02-15 22:21:00,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:00" (1/1) ... [2023-02-15 22:21:00,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:21:00,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:21:00,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:21:00,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:21:00,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:00" (1/1) ... [2023-02-15 22:21:00,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:21:00,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:21:00,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 22:21:00,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 22:21:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 22:21:00,630 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 22:21:00,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 22:21:00,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:21:00,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:21:00,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:21:00,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:21:00,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 22:21:00,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 22:21:00,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:21:00,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:21:00,745 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:21:00,747 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:21:00,801 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 22:21:01,091 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:21:01,097 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:21:01,097 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 22:21:01,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:01 BoogieIcfgContainer [2023-02-15 22:21:01,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:21:01,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:21:01,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:21:01,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:21:01,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:21:00" (1/3) ... [2023-02-15 22:21:01,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713bcb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:21:01, skipping insertion in model container [2023-02-15 22:21:01,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:00" (2/3) ... [2023-02-15 22:21:01,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713bcb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:21:01, skipping insertion in model container [2023-02-15 22:21:01,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:01" (3/3) ... [2023-02-15 22:21:01,106 INFO L112 eAbstractionObserver]: Analyzing ICFG list-1.i [2023-02-15 22:21:01,120 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:21:01,121 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-02-15 22:21:01,156 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:21:01,162 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b3063bf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:21:01,162 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-02-15 22:21:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 64 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:01,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:21:01,170 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:01,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:21:01,172 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:21:01,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:01,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516551, now seen corresponding path program 1 times [2023-02-15 22:21:01,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:01,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413702656] [2023-02-15 22:21:01,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:01,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:01,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:01,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:01,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 22:21:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:01,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:21:01,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:01,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 22:21:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:01,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:01,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:01,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413702656] [2023-02-15 22:21:01,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413702656] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:01,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:01,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:21:01,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386454640] [2023-02-15 22:21:01,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:01,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:21:01,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:01,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:21:01,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:21:01,528 INFO L87 Difference]: Start difference. First operand has 66 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 64 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 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 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:01,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:01,757 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2023-02-15 22:21:01,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:21:01,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 22:21:01,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:01,764 INFO L225 Difference]: With dead ends: 71 [2023-02-15 22:21:01,764 INFO L226 Difference]: Without dead ends: 64 [2023-02-15 22:21:01,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:21:01,771 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 111 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:01,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 36 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:21:01,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-15 22:21:01,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2023-02-15 22:21:01,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.725) internal successors, (69), 58 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:01,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2023-02-15 22:21:01,805 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 6 [2023-02-15 22:21:01,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:01,805 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2023-02-15 22:21:01,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2023-02-15 22:21:01,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:21:01,806 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:01,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:21:01,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 22:21:02,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:02,018 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:21:02,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:02,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516552, now seen corresponding path program 1 times [2023-02-15 22:21:02,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:02,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965616424] [2023-02-15 22:21:02,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:02,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:02,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:02,024 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:02,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 22:21:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:02,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 22:21:02,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:02,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:21:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:02,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:02,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:02,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965616424] [2023-02-15 22:21:02,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965616424] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:02,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:02,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:21:02,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359876225] [2023-02-15 22:21:02,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:02,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:21:02,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:02,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:21:02,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:21:02,155 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:02,410 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2023-02-15 22:21:02,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:21:02,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 22:21:02,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:02,414 INFO L225 Difference]: With dead ends: 84 [2023-02-15 22:21:02,414 INFO L226 Difference]: Without dead ends: 84 [2023-02-15 22:21:02,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:21:02,415 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 108 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:02,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 41 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:21:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-15 22:21:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2023-02-15 22:21:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.5) internal successors, (81), 72 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2023-02-15 22:21:02,426 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 6 [2023-02-15 22:21:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:02,427 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2023-02-15 22:21:02,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2023-02-15 22:21:02,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:21:02,429 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:02,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:02,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:02,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:02,638 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:21:02,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:02,639 INFO L85 PathProgramCache]: Analyzing trace with hash 423224549, now seen corresponding path program 1 times [2023-02-15 22:21:02,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:02,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018693525] [2023-02-15 22:21:02,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:02,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:02,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:02,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:02,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 22:21:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:02,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:21:02,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:02,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:21:02,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:21:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:02,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:02,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:02,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018693525] [2023-02-15 22:21:02,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018693525] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:02,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:02,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:21:02,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791576427] [2023-02-15 22:21:02,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:02,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:21:02,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:02,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:21:02,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:21:02,804 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:03,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:03,103 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2023-02-15 22:21:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:21:03,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 22:21:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:03,108 INFO L225 Difference]: With dead ends: 112 [2023-02-15 22:21:03,109 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 22:21:03,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:21:03,110 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 80 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:03,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 161 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:21:03,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 22:21:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 76. [2023-02-15 22:21:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.4736842105263157) 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) [2023-02-15 22:21:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2023-02-15 22:21:03,119 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 13 [2023-02-15 22:21:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:03,120 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2023-02-15 22:21:03,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2023-02-15 22:21:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:21:03,127 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:03,128 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:03,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:03,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:03,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:21:03,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:03,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769667, now seen corresponding path program 1 times [2023-02-15 22:21:03,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:03,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427536309] [2023-02-15 22:21:03,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:03,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:03,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:03,340 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:03,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 22:21:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:03,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 22:21:03,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:03,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 22:21:03,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:21:03,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-15 22:21:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:03,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:03,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:03,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427536309] [2023-02-15 22:21:03,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427536309] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:03,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:03,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:21:03,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761832108] [2023-02-15 22:21:03,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:03,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:21:03,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:03,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:21:03,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:21:03,467 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:03,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:03,833 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2023-02-15 22:21:03,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:21:03,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 22:21:03,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:03,835 INFO L225 Difference]: With dead ends: 100 [2023-02-15 22:21:03,835 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 22:21:03,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:21:03,836 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 85 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:03,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 131 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:21:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 22:21:03,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 78. [2023-02-15 22:21:03,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:03,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2023-02-15 22:21:03,846 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 13 [2023-02-15 22:21:03,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:03,846 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2023-02-15 22:21:03,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:03,846 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2023-02-15 22:21:03,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:21:03,847 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:03,847 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:03,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:04,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:04,048 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:21:04,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:04,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769666, now seen corresponding path program 1 times [2023-02-15 22:21:04,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:04,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779466729] [2023-02-15 22:21:04,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:04,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:04,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:04,081 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:04,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 22:21:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:04,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:21:04,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:04,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:21:04,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:21:04,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:21:04,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-02-15 22:21:04,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 22:21:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:04,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:04,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:04,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779466729] [2023-02-15 22:21:04,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779466729] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:04,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:04,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:21:04,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916414347] [2023-02-15 22:21:04,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:04,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:21:04,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:04,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:21:04,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:21:04,291 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:04,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:04,784 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2023-02-15 22:21:04,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:21:04,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 22:21:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:04,786 INFO L225 Difference]: With dead ends: 101 [2023-02-15 22:21:04,786 INFO L226 Difference]: Without dead ends: 101 [2023-02-15 22:21:04,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:21:04,787 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 59 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:04,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 166 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:21:04,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-15 22:21:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2023-02-15 22:21:04,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:04,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2023-02-15 22:21:04,793 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 13 [2023-02-15 22:21:04,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:04,793 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2023-02-15 22:21:04,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2023-02-15 22:21:04,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 22:21:04,794 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:04,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:04,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:05,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:05,003 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:21:05,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:05,004 INFO L85 PathProgramCache]: Analyzing trace with hash 916718725, now seen corresponding path program 1 times [2023-02-15 22:21:05,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:05,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737074548] [2023-02-15 22:21:05,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:05,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:05,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:05,005 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:05,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 22:21:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:05,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 22:21:05,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:05,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 22:21:05,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:21:05,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-15 22:21:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:05,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:05,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:05,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737074548] [2023-02-15 22:21:05,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737074548] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:05,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:05,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:21:05,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702635623] [2023-02-15 22:21:05,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:05,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:21:05,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:05,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:21:05,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:21:05,150 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:05,436 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2023-02-15 22:21:05,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:21:05,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-02-15 22:21:05,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:05,437 INFO L225 Difference]: With dead ends: 91 [2023-02-15 22:21:05,437 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 22:21:05,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:21:05,438 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 78 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:05,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 123 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:21:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 22:21:05,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 67. [2023-02-15 22:21:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 66 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2023-02-15 22:21:05,443 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 14 [2023-02-15 22:21:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:05,443 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2023-02-15 22:21:05,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2023-02-15 22:21:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 22:21:05,444 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:05,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:05,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:05,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:05,654 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:21:05,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:05,655 INFO L85 PathProgramCache]: Analyzing trace with hash 916718726, now seen corresponding path program 1 times [2023-02-15 22:21:05,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:05,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756903446] [2023-02-15 22:21:05,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:05,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:05,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:05,658 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:05,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 22:21:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:05,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:21:05,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:05,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:21:05,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:21:05,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:21:05,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-02-15 22:21:05,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 22:21:05,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:05,828 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:05,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:05,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756903446] [2023-02-15 22:21:05,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756903446] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:05,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:05,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:21:05,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113850701] [2023-02-15 22:21:05,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:05,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:21:05,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:05,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:21:05,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:21:05,834 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:06,226 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2023-02-15 22:21:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:21:06,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-02-15 22:21:06,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:06,227 INFO L225 Difference]: With dead ends: 88 [2023-02-15 22:21:06,227 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 22:21:06,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:21:06,228 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 51 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:06,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 154 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:21:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 22:21:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2023-02-15 22:21:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2023-02-15 22:21:06,233 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 14 [2023-02-15 22:21:06,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:06,233 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2023-02-15 22:21:06,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2023-02-15 22:21:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:21:06,234 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:06,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:06,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:06,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:06,443 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:21:06,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:06,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1350732505, now seen corresponding path program 1 times [2023-02-15 22:21:06,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:06,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021815640] [2023-02-15 22:21:06,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:06,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:06,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:06,444 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:06,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 22:21:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:06,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:21:06,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:06,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:21:06,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:21:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:06,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:06,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:06,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021815640] [2023-02-15 22:21:06,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021815640] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:06,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:06,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:21:06,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981839089] [2023-02-15 22:21:06,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:06,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:21:06,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:06,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:21:06,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:21:06,555 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:06,806 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2023-02-15 22:21:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:21:06,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 22:21:06,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:06,808 INFO L225 Difference]: With dead ends: 100 [2023-02-15 22:21:06,808 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 22:21:06,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:21:06,808 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 70 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:06,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 134 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:21:06,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 22:21:06,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 60. [2023-02-15 22:21:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2023-02-15 22:21:06,817 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 15 [2023-02-15 22:21:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:06,817 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2023-02-15 22:21:06,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2023-02-15 22:21:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:21:06,818 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:06,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:06,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:07,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:07,019 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:21:07,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:07,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1350679950, now seen corresponding path program 1 times [2023-02-15 22:21:07,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:07,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562446248] [2023-02-15 22:21:07,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:07,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:07,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:07,021 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:07,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 22:21:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:07,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:21:07,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:07,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:21:07,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:21:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:07,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:07,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:07,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562446248] [2023-02-15 22:21:07,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562446248] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:07,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:07,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:21:07,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861031560] [2023-02-15 22:21:07,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:07,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:21:07,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:07,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:21:07,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:21:07,135 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:07,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:07,363 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2023-02-15 22:21:07,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:21:07,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 22:21:07,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:07,364 INFO L225 Difference]: With dead ends: 83 [2023-02-15 22:21:07,364 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 22:21:07,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:21:07,365 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:07,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 124 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:21:07,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 22:21:07,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 60. [2023-02-15 22:21:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 59 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2023-02-15 22:21:07,370 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 15 [2023-02-15 22:21:07,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:07,370 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2023-02-15 22:21:07,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2023-02-15 22:21:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:21:07,371 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:07,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:07,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:07,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:07,577 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-15 22:21:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:07,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1076970395, now seen corresponding path program 1 times [2023-02-15 22:21:07,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:07,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109628534] [2023-02-15 22:21:07,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:07,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:07,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:07,579 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:07,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 22:21:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:21:07,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 22:21:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:21:07,703 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 22:21:07,703 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 22:21:07,704 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2023-02-15 22:21:07,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2023-02-15 22:21:07,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2023-02-15 22:21:07,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2023-02-15 22:21:07,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2023-02-15 22:21:07,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2023-02-15 22:21:07,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2023-02-15 22:21:07,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2023-02-15 22:21:07,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2023-02-15 22:21:07,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2023-02-15 22:21:07,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2023-02-15 22:21:07,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2023-02-15 22:21:07,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2023-02-15 22:21:07,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2023-02-15 22:21:07,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2023-02-15 22:21:07,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2023-02-15 22:21:07,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2023-02-15 22:21:07,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2023-02-15 22:21:07,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2023-02-15 22:21:07,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2023-02-15 22:21:07,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2023-02-15 22:21:07,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2023-02-15 22:21:07,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2023-02-15 22:21:07,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2023-02-15 22:21:07,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2023-02-15 22:21:07,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (0 of 26 remaining) [2023-02-15 22:21:07,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:07,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:07,912 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:07,915 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 22:21:07,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:21:07 BoogieIcfgContainer [2023-02-15 22:21:07,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 22:21:07,930 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 22:21:07,930 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 22:21:07,930 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 22:21:07,931 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:01" (3/4) ... [2023-02-15 22:21:07,933 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 22:21:07,933 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 22:21:07,933 INFO L158 Benchmark]: Toolchain (without parser) took 7906.52ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 48.6MB in the beginning and 36.4MB in the end (delta: 12.2MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2023-02-15 22:21:07,933 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 33.4MB in the beginning and 33.4MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:21:07,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.31ms. Allocated memory is still 75.5MB. Free memory was 48.4MB in the beginning and 49.5MB in the end (delta: -1.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2023-02-15 22:21:07,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.07ms. Allocated memory is still 75.5MB. Free memory was 49.2MB in the beginning and 47.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:21:07,934 INFO L158 Benchmark]: Boogie Preprocessor took 59.89ms. Allocated memory is still 75.5MB. Free memory was 47.4MB in the beginning and 45.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:21:07,934 INFO L158 Benchmark]: RCFGBuilder took 542.32ms. Allocated memory is still 75.5MB. Free memory was 45.4MB in the beginning and 45.7MB in the end (delta: -292.6kB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2023-02-15 22:21:07,935 INFO L158 Benchmark]: TraceAbstraction took 6828.99ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 45.1MB in the beginning and 37.1MB in the end (delta: 8.0MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2023-02-15 22:21:07,935 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 92.3MB. Free memory was 37.1MB in the beginning and 36.4MB in the end (delta: 721.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:21:07,936 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 56.6MB. Free memory was 33.4MB in the beginning and 33.4MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.31ms. Allocated memory is still 75.5MB. Free memory was 48.4MB in the beginning and 49.5MB in the end (delta: -1.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.07ms. Allocated memory is still 75.5MB. Free memory was 49.2MB in the beginning and 47.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.89ms. Allocated memory is still 75.5MB. Free memory was 47.4MB in the beginning and 45.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 542.32ms. Allocated memory is still 75.5MB. Free memory was 45.4MB in the beginning and 45.7MB in the end (delta: -292.6kB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6828.99ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 45.1MB in the beginning and 37.1MB in the end (delta: 8.0MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 92.3MB. Free memory was 37.1MB in the beginning and 36.4MB in the end (delta: 721.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={6:0}] [L534] List t; [L535] List p = a; VAL [a={6:0}, p={6:0}] [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 VAL [a={6:0}, p={6:0}] [L551] p = a VAL [a={6:0}, p={6:0}] [L552] EXPR p->h VAL [a={6:0}, p={6:0}, p->h=3] [L552] COND FALSE !(p->h == 1) [L554] EXPR p->h VAL [a={6:0}, p={6:0}, p->h=3] [L554] COND FALSE !(p->h == 2) [L556] EXPR p->h VAL [a={6:0}, p={6:0}, p->h=3] [L556] COND FALSE !(p->h != 3) [L558] return 0; VAL [\result=0, a={6:0}, p={6:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 692 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 692 mSDsluCounter, 1070 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 719 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1157 IncrementalHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 351 mSDtfsCounter, 1157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=4, InterpolantAutomatonStates: 58, 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, 9 MinimizatonAttempts, 225 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 492 SizeOfPredicates, 44 NumberOfNonLiveVariables, 521 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 8/8 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 [2023-02-15 22:21:07,957 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