./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/simple-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae 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/simple-2.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 a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:38:56,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:38:56,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:38:57,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:38:57,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:38:57,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:38:57,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:38:57,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:38:57,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:38:57,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:38:57,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:38:57,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:38:57,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:38:57,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:38:57,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:38:57,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:38:57,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:38:57,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:38:57,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:38:57,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:38:57,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:38:57,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:38:57,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:38:57,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:38:57,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:38:57,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:38:57,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:38:57,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:38:57,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:38:57,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:38:57,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:38:57,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:38:57,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:38:57,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:38:57,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:38:57,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:38:57,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:38:57,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:38:57,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:38:57,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:38:57,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:38:57,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:38:57,088 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:38:57,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:38:57,089 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:38:57,089 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:38:57,090 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:38:57,090 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:38:57,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:38:57,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:38:57,091 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:38:57,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:38:57,091 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:38:57,091 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:38:57,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:38:57,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:38:57,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:38:57,092 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:38:57,092 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:38:57,092 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:38:57,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:38:57,092 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:38:57,093 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:38:57,093 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:38:57,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:38:57,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:38:57,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:38:57,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:38:57,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:38:57,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:38:57,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:38:57,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:38:57,094 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:38:57,095 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:38:57,095 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:38:57,095 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:38:57,095 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 -> a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 [2023-02-16 03:38:57,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:38:57,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:38:57,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:38:57,290 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:38:57,290 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:38:57,291 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple-2.i [2023-02-16 03:38:58,465 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:38:58,769 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:38:58,770 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i [2023-02-16 03:38:58,781 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3c796cfb/11d510dd666746ac85e2d4edc1f1cdd3/FLAG6ecd700d6 [2023-02-16 03:38:58,791 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3c796cfb/11d510dd666746ac85e2d4edc1f1cdd3 [2023-02-16 03:38:58,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:38:58,794 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:38:58,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:38:58,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:38:58,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:38:58,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:38:58" (1/1) ... [2023-02-16 03:38:58,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fe03b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:38:58, skipping insertion in model container [2023-02-16 03:38:58,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:38:58" (1/1) ... [2023-02-16 03:38:58,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:38:58,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:38:59,143 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/simple-2.i[23225,23238] [2023-02-16 03:38:59,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:38:59,158 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:38:59,203 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/simple-2.i[23225,23238] [2023-02-16 03:38:59,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:38:59,235 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:38:59,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:38:59 WrapperNode [2023-02-16 03:38:59,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:38:59,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:38:59,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:38:59,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:38:59,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:38:59" (1/1) ... [2023-02-16 03:38:59,270 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:38:59" (1/1) ... [2023-02-16 03:38:59,289 INFO L138 Inliner]: procedures = 124, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2023-02-16 03:38:59,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:38:59,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:38:59,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:38:59,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:38:59,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:38:59" (1/1) ... [2023-02-16 03:38:59,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:38:59" (1/1) ... [2023-02-16 03:38:59,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:38:59" (1/1) ... [2023-02-16 03:38:59,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:38:59" (1/1) ... [2023-02-16 03:38:59,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:38:59" (1/1) ... [2023-02-16 03:38:59,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:38:59" (1/1) ... [2023-02-16 03:38:59,328 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:38:59" (1/1) ... [2023-02-16 03:38:59,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:38:59" (1/1) ... [2023-02-16 03:38:59,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:38:59,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:38:59,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:38:59,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:38:59,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:38:59" (1/1) ... [2023-02-16 03:38:59,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:38:59,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:38:59,370 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-16 03:38:59,389 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-16 03:38:59,406 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-16 03:38:59,407 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-16 03:38:59,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 03:38:59,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 03:38:59,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:38:59,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:38:59,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:38:59,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:38:59,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 03:38:59,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:38:59,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:38:59,524 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:38:59,527 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:38:59,574 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-16 03:38:59,694 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:38:59,699 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:38:59,699 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 03:38:59,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:38:59 BoogieIcfgContainer [2023-02-16 03:38:59,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:38:59,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:38:59,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:38:59,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:38:59,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:38:58" (1/3) ... [2023-02-16 03:38:59,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d88e69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:38:59, skipping insertion in model container [2023-02-16 03:38:59,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:38:59" (2/3) ... [2023-02-16 03:38:59,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d88e69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:38:59, skipping insertion in model container [2023-02-16 03:38:59,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:38:59" (3/3) ... [2023-02-16 03:38:59,708 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-2.i [2023-02-16 03:38:59,723 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:38:59,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-16 03:38:59,762 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:38:59,767 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;@2eb72a92, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:38:59,768 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-16 03:38:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 43 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:38:59,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:38:59,778 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:38:59,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:38:59,780 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:38:59,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:38:59,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517224, now seen corresponding path program 1 times [2023-02-16 03:38:59,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:38:59,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517079908] [2023-02-16 03:38:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:38:59,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:38:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:38:59,953 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-16 03:38:59,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:38:59,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517079908] [2023-02-16 03:38:59,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517079908] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:38:59,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:38:59,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:38:59,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153967156] [2023-02-16 03:38:59,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:38:59,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 03:38:59,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:38:59,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 03:38:59,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 03:38:59,998 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 43 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-16 03:39:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:39:00,027 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2023-02-16 03:39:00,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 03:39:00,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-16 03:39:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:39:00,033 INFO L225 Difference]: With dead ends: 45 [2023-02-16 03:39:00,033 INFO L226 Difference]: Without dead ends: 39 [2023-02-16 03:39:00,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 03:39:00,037 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:39:00,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:39:00,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-16 03:39:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-02-16 03:39:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:39:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2023-02-16 03:39:00,072 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 6 [2023-02-16 03:39:00,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:39:00,072 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2023-02-16 03:39:00,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-16 03:39:00,073 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2023-02-16 03:39:00,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-16 03:39:00,073 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:39:00,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:39:00,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:39:00,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:39:00,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:39:00,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238120, now seen corresponding path program 1 times [2023-02-16 03:39:00,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:39:00,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256370360] [2023-02-16 03:39:00,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:00,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:39:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:39:00,180 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-16 03:39:00,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:39:00,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256370360] [2023-02-16 03:39:00,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256370360] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:39:00,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:39:00,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:39:00,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710175276] [2023-02-16 03:39:00,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:39:00,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:39:00,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:39:00,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:39:00,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:39:00,184 INFO L87 Difference]: Start difference. First operand 39 states and 40 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-16 03:39:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:39:00,253 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2023-02-16 03:39:00,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:39:00,253 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-16 03:39:00,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:39:00,254 INFO L225 Difference]: With dead ends: 47 [2023-02-16 03:39:00,255 INFO L226 Difference]: Without dead ends: 47 [2023-02-16 03:39:00,255 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-16 03:39:00,256 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:39:00,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 16 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:39:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-16 03:39:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2023-02-16 03:39:00,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 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-16 03:39:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-02-16 03:39:00,262 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 7 [2023-02-16 03:39:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:39:00,262 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-02-16 03:39:00,262 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-16 03:39:00,263 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-02-16 03:39:00,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-16 03:39:00,263 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:39:00,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:39:00,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:39:00,264 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:39:00,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:39:00,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238121, now seen corresponding path program 1 times [2023-02-16 03:39:00,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:39:00,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162052289] [2023-02-16 03:39:00,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:00,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:39:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:39:00,425 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-16 03:39:00,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:39:00,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162052289] [2023-02-16 03:39:00,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162052289] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:39:00,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:39:00,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:39:00,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426432844] [2023-02-16 03:39:00,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:39:00,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:39:00,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:39:00,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:39:00,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:39:00,428 INFO L87 Difference]: Start difference. First operand 41 states and 47 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-16 03:39:00,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:39:00,537 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2023-02-16 03:39:00,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:39:00,537 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-16 03:39:00,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:39:00,540 INFO L225 Difference]: With dead ends: 56 [2023-02-16 03:39:00,540 INFO L226 Difference]: Without dead ends: 56 [2023-02-16 03:39:00,544 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-16 03:39:00,545 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 69 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:39:00,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 25 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:39:00,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-16 03:39:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2023-02-16 03:39:00,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:39:00,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-02-16 03:39:00,553 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 7 [2023-02-16 03:39:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:39:00,554 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-02-16 03:39:00,554 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-16 03:39:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-02-16 03:39:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:39:00,554 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:39:00,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:39:00,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 03:39:00,555 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:39:00,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:39:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1884133396, now seen corresponding path program 1 times [2023-02-16 03:39:00,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:39:00,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926075139] [2023-02-16 03:39:00,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:00,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:39:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:39:00,641 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-16 03:39:00,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:39:00,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926075139] [2023-02-16 03:39:00,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926075139] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:39:00,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:39:00,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:39:00,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266653945] [2023-02-16 03:39:00,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:39:00,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:39:00,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:39:00,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:39:00,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:39:00,644 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:39:00,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:39:00,703 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2023-02-16 03:39:00,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:39:00,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-16 03:39:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:39:00,705 INFO L225 Difference]: With dead ends: 53 [2023-02-16 03:39:00,706 INFO L226 Difference]: Without dead ends: 53 [2023-02-16 03:39:00,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:39:00,707 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 59 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:39:00,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 37 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:39:00,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-16 03:39:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2023-02-16 03:39:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:39:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2023-02-16 03:39:00,718 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 12 [2023-02-16 03:39:00,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:39:00,719 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2023-02-16 03:39:00,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:39:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2023-02-16 03:39:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 03:39:00,720 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:39:00,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:39:00,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 03:39:00,720 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:39:00,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:39:00,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1721365971, now seen corresponding path program 1 times [2023-02-16 03:39:00,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:39:00,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714355050] [2023-02-16 03:39:00,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:00,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:39:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:39:00,897 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-16 03:39:00,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:39:00,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714355050] [2023-02-16 03:39:00,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714355050] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:39:00,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:39:00,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:39:00,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049036700] [2023-02-16 03:39:00,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:39:00,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:39:00,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:39:00,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:39:00,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:39:00,901 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-16 03:39:01,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:39:01,040 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2023-02-16 03:39:01,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:39:01,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-16 03:39:01,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:39:01,042 INFO L225 Difference]: With dead ends: 85 [2023-02-16 03:39:01,042 INFO L226 Difference]: Without dead ends: 85 [2023-02-16 03:39:01,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:39:01,044 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 74 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:39:01,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 99 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:39:01,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-16 03:39:01,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 52. [2023-02-16 03:39:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.375) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 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-16 03:39:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2023-02-16 03:39:01,055 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 13 [2023-02-16 03:39:01,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:39:01,056 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2023-02-16 03:39:01,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-16 03:39:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2023-02-16 03:39:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 03:39:01,060 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:39:01,060 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:39:01,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 03:39:01,060 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:39:01,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:39:01,061 INFO L85 PathProgramCache]: Analyzing trace with hash 761251611, now seen corresponding path program 1 times [2023-02-16 03:39:01,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:39:01,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458621602] [2023-02-16 03:39:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:01,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:39:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:39:01,158 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-16 03:39:01,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:39:01,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458621602] [2023-02-16 03:39:01,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458621602] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:39:01,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:39:01,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:39:01,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504513671] [2023-02-16 03:39:01,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:39:01,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:39:01,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:39:01,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:39:01,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:39:01,161 INFO L87 Difference]: Start difference. First operand 52 states and 55 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-16 03:39:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:39:01,280 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2023-02-16 03:39:01,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:39:01,280 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-16 03:39:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:39:01,282 INFO L225 Difference]: With dead ends: 64 [2023-02-16 03:39:01,283 INFO L226 Difference]: Without dead ends: 64 [2023-02-16 03:39:01,283 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-16 03:39:01,286 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 45 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:39:01,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 93 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:39:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-16 03:39:01,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2023-02-16 03:39:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.325) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:39:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2023-02-16 03:39:01,302 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 15 [2023-02-16 03:39:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:39:01,302 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2023-02-16 03:39:01,303 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-16 03:39:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2023-02-16 03:39:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 03:39:01,304 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:39:01,304 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:39:01,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 03:39:01,304 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:39:01,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:39:01,305 INFO L85 PathProgramCache]: Analyzing trace with hash 761251612, now seen corresponding path program 1 times [2023-02-16 03:39:01,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:39:01,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754223759] [2023-02-16 03:39:01,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:01,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:39:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:39:01,477 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-16 03:39:01,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:39:01,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754223759] [2023-02-16 03:39:01,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754223759] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:39:01,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:39:01,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:39:01,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880604808] [2023-02-16 03:39:01,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:39:01,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:39:01,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:39:01,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:39:01,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:39:01,482 INFO L87 Difference]: Start difference. First operand 50 states and 53 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-16 03:39:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:39:01,644 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2023-02-16 03:39:01,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:39:01,645 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-16 03:39:01,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:39:01,645 INFO L225 Difference]: With dead ends: 60 [2023-02-16 03:39:01,646 INFO L226 Difference]: Without dead ends: 60 [2023-02-16 03:39:01,646 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-16 03:39:01,647 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:39:01,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 111 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:39:01,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-16 03:39:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2023-02-16 03:39:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 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-16 03:39:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-02-16 03:39:01,650 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 15 [2023-02-16 03:39:01,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:39:01,651 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-02-16 03:39:01,652 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-16 03:39:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-02-16 03:39:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:39:01,653 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:39:01,653 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:39:01,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 03:39:01,653 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:39:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:39:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash 700715683, now seen corresponding path program 1 times [2023-02-16 03:39:01,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:39:01,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534746588] [2023-02-16 03:39:01,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:01,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:39:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:39:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:39:01,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:39:01,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534746588] [2023-02-16 03:39:01,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534746588] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:39:01,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178231500] [2023-02-16 03:39:01,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:01,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:39:01,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:39:01,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:39:01,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 03:39:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:39:02,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-16 03:39:02,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:39:02,089 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-16 03:39:02,093 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-16 03:39:02,148 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-16 03:39:02,151 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-16 03:39:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:39:02,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:39:02,325 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 27 treesize of output 21 [2023-02-16 03:39:02,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:39:02,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:39:02,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:39:02,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178231500] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:39:02,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:39:02,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 16 [2023-02-16 03:39:02,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132251567] [2023-02-16 03:39:02,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:39:02,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-16 03:39:02,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:39:02,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-16 03:39:02,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-02-16 03:39:02,463 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:39:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:39:02,660 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2023-02-16 03:39:02,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:39:02,660 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-16 03:39:02,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:39:02,661 INFO L225 Difference]: With dead ends: 55 [2023-02-16 03:39:02,661 INFO L226 Difference]: Without dead ends: 55 [2023-02-16 03:39:02,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2023-02-16 03:39:02,662 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 129 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:39:02,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 127 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:39:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-16 03:39:02,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2023-02-16 03:39:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 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-16 03:39:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2023-02-16 03:39:02,665 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 16 [2023-02-16 03:39:02,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:39:02,666 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2023-02-16 03:39:02,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:39:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2023-02-16 03:39:02,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:39:02,667 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:39:02,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:39:02,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 03:39:02,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:39:02,873 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:39:02,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:39:02,874 INFO L85 PathProgramCache]: Analyzing trace with hash 247348413, now seen corresponding path program 1 times [2023-02-16 03:39:02,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:39:02,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725779681] [2023-02-16 03:39:02,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:02,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:39:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 03:39:02,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 03:39:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 03:39:02,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 03:39:02,905 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 03:39:02,906 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-02-16 03:39:02,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2023-02-16 03:39:02,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-02-16 03:39:02,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-02-16 03:39:02,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-02-16 03:39:02,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-02-16 03:39:02,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-02-16 03:39:02,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-02-16 03:39:02,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-02-16 03:39:02,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-02-16 03:39:02,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2023-02-16 03:39:02,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2023-02-16 03:39:02,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2023-02-16 03:39:02,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (2 of 16 remaining) [2023-02-16 03:39:02,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2023-02-16 03:39:02,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 16 remaining) [2023-02-16 03:39:02,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 03:39:02,913 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:39:02,916 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 03:39:02,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 03:39:02 BoogieIcfgContainer [2023-02-16 03:39:02,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 03:39:02,937 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 03:39:02,937 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 03:39:02,937 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 03:39:02,937 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:38:59" (3/4) ... [2023-02-16 03:39:02,940 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-16 03:39:02,940 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 03:39:02,940 INFO L158 Benchmark]: Toolchain (without parser) took 4146.78ms. Allocated memory was 121.6MB in the beginning and 151.0MB in the end (delta: 29.4MB). Free memory was 87.0MB in the beginning and 46.6MB in the end (delta: 40.3MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. [2023-02-16 03:39:02,941 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 98.6MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:39:02,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.73ms. Allocated memory is still 121.6MB. Free memory was 87.0MB in the beginning and 70.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-16 03:39:02,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.65ms. Allocated memory is still 121.6MB. Free memory was 70.2MB in the beginning and 68.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 03:39:02,942 INFO L158 Benchmark]: Boogie Preprocessor took 46.58ms. Allocated memory is still 121.6MB. Free memory was 68.5MB in the beginning and 67.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:39:02,942 INFO L158 Benchmark]: RCFGBuilder took 363.80ms. Allocated memory is still 121.6MB. Free memory was 67.2MB in the beginning and 53.4MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 03:39:02,942 INFO L158 Benchmark]: TraceAbstraction took 3233.35ms. Allocated memory was 121.6MB in the beginning and 151.0MB in the end (delta: 29.4MB). Free memory was 52.5MB in the beginning and 46.6MB in the end (delta: 5.8MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2023-02-16 03:39:02,942 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 151.0MB. Free memory is still 46.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:39:02,944 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.18ms. Allocated memory is still 98.6MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.73ms. Allocated memory is still 121.6MB. Free memory was 87.0MB in the beginning and 70.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.65ms. Allocated memory is still 121.6MB. Free memory was 70.2MB in the beginning and 68.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.58ms. Allocated memory is still 121.6MB. Free memory was 68.5MB in the beginning and 67.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 363.80ms. Allocated memory is still 121.6MB. Free memory was 67.2MB in the beginning and 53.4MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3233.35ms. Allocated memory was 121.6MB in the beginning and 151.0MB in the end (delta: 29.4MB). Free memory was 52.5MB in the beginning and 46.6MB in the end (delta: 5.8MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 151.0MB. Free memory is still 46.6MB. 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] p->h = 1 VAL [a={-1:0}, p={-1:0}] [L544] p->n = 0 VAL [a={-1:0}, p={-1:0}] [L545] p = a VAL [a={-1:0}, p={-1:0}] [L546] COND TRUE p!=0 VAL [a={-1:0}, p={-1:0}] [L547] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=1] [L547] COND FALSE !(p->h != 1) [L550] EXPR p->n VAL [a={-1:0}, p={-1:0}, p->n={0:0}] [L550] p = p->n [L546] COND FALSE !(p!=0) VAL [a={-1:0}, p={0:0}] [L552] return 0; VAL [\result=0, a={-1:0}, p={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 475 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 475 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 340 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 590 IncrementalHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 216 mSDtfsCounter, 590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=5, InterpolantAutomatonStates: 46, 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, 8 MinimizatonAttempts, 98 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 113 ConstructedInterpolants, 1 QuantifiedInterpolants, 879 SizeOfPredicates, 12 NumberOfNonLiveVariables, 102 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 7/10 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-16 03:39:02,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/simple-2.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 a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:39:05,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:39:05,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:39:05,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:39:05,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:39:05,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:39:05,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:39:05,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:39:05,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:39:05,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:39:05,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:39:05,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:39:05,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:39:05,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:39:05,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:39:05,121 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:39:05,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:39:05,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:39:05,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:39:05,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:39:05,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:39:05,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:39:05,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:39:05,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:39:05,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:39:05,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:39:05,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:39:05,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:39:05,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:39:05,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:39:05,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:39:05,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:39:05,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:39:05,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:39:05,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:39:05,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:39:05,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:39:05,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:39:05,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:39:05,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:39:05,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:39:05,167 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-16 03:39:05,199 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:39:05,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:39:05,200 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:39:05,200 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:39:05,201 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:39:05,201 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:39:05,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:39:05,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:39:05,202 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:39:05,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:39:05,203 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:39:05,203 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:39:05,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:39:05,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:39:05,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:39:05,204 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:39:05,204 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:39:05,204 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:39:05,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:39:05,205 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:39:05,205 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 03:39:05,205 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 03:39:05,205 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:39:05,205 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:39:05,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:39:05,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:39:05,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:39:05,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:39:05,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:39:05,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:39:05,207 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 03:39:05,207 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 03:39:05,207 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:39:05,207 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:39:05,207 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:39:05,208 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 03:39:05,208 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:39:05,208 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 -> a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 [2023-02-16 03:39:05,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:39:05,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:39:05,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:39:05,560 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:39:05,561 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:39:05,564 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple-2.i [2023-02-16 03:39:06,699 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:39:06,919 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:39:06,920 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i [2023-02-16 03:39:06,933 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429040c64/3c6ff1455f974d6989b274bc9d50b21f/FLAGc0438d686 [2023-02-16 03:39:06,949 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429040c64/3c6ff1455f974d6989b274bc9d50b21f [2023-02-16 03:39:06,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:39:06,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:39:06,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:39:06,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:39:06,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:39:06,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:39:06" (1/1) ... [2023-02-16 03:39:06,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564f112f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:39:06, skipping insertion in model container [2023-02-16 03:39:06,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:39:06" (1/1) ... [2023-02-16 03:39:06,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:39:07,013 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:39:07,272 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/simple-2.i[23225,23238] [2023-02-16 03:39:07,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:39:07,297 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:39:07,376 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/simple-2.i[23225,23238] [2023-02-16 03:39:07,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:39:07,420 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:39:07,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:39:07 WrapperNode [2023-02-16 03:39:07,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:39:07,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:39:07,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:39:07,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:39:07,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:39:07" (1/1) ... [2023-02-16 03:39:07,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:39:07" (1/1) ... [2023-02-16 03:39:07,479 INFO L138 Inliner]: procedures = 127, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2023-02-16 03:39:07,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:39:07,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:39:07,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:39:07,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:39:07,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:39:07" (1/1) ... [2023-02-16 03:39:07,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:39:07" (1/1) ... [2023-02-16 03:39:07,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:39:07" (1/1) ... [2023-02-16 03:39:07,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:39:07" (1/1) ... [2023-02-16 03:39:07,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:39:07" (1/1) ... [2023-02-16 03:39:07,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:39:07" (1/1) ... [2023-02-16 03:39:07,525 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:39:07" (1/1) ... [2023-02-16 03:39:07,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:39:07" (1/1) ... [2023-02-16 03:39:07,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:39:07,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:39:07,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:39:07,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:39:07,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:39:07" (1/1) ... [2023-02-16 03:39:07,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:39:07,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:39:07,561 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-16 03:39:07,581 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-16 03:39:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-16 03:39:07,600 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-16 03:39:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-16 03:39:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:39:07,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:39:07,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:39:07,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:39:07,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-16 03:39:07,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 03:39:07,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:39:07,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:39:07,770 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:39:07,771 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:39:07,803 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-16 03:39:08,050 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:39:08,056 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:39:08,057 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 03:39:08,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:39:08 BoogieIcfgContainer [2023-02-16 03:39:08,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:39:08,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:39:08,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:39:08,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:39:08,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:39:06" (1/3) ... [2023-02-16 03:39:08,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359a0c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:39:08, skipping insertion in model container [2023-02-16 03:39:08,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:39:07" (2/3) ... [2023-02-16 03:39:08,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359a0c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:39:08, skipping insertion in model container [2023-02-16 03:39:08,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:39:08" (3/3) ... [2023-02-16 03:39:08,067 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-2.i [2023-02-16 03:39:08,082 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:39:08,082 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-16 03:39:08,128 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:39:08,133 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;@4432b8bc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:39:08,134 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-16 03:39:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.92) internal successors, (48), 42 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:39:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:39:08,142 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:39:08,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:39:08,143 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:39:08,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:39:08,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516511, now seen corresponding path program 1 times [2023-02-16 03:39:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:39:08,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103787860] [2023-02-16 03:39:08,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:08,162 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-16 03:39:08,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:39:08,169 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-16 03:39:08,208 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-16 03:39:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:39:08,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:39:08,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:39:08,305 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-16 03:39:08,373 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-16 03:39:08,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:39:08,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:39:08,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103787860] [2023-02-16 03:39:08,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103787860] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:39:08,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:39:08,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:39:08,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157327740] [2023-02-16 03:39:08,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:39:08,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:39:08,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:39:08,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:39:08,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:39:08,418 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.92) internal successors, (48), 42 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 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-16 03:39:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:39:08,619 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2023-02-16 03:39:08,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:39:08,622 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-16 03:39:08,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:39:08,626 INFO L225 Difference]: With dead ends: 74 [2023-02-16 03:39:08,627 INFO L226 Difference]: Without dead ends: 65 [2023-02-16 03:39:08,628 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-16 03:39:08,631 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 95 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:39:08,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 34 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:39:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-16 03:39:08,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2023-02-16 03:39:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:39:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2023-02-16 03:39:08,654 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 6 [2023-02-16 03:39:08,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:39:08,655 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2023-02-16 03:39:08,655 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-16 03:39:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2023-02-16 03:39:08,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:39:08,656 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:39:08,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:39:08,668 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 (2)] Forceful destruction successful, exit code 0 [2023-02-16 03:39:08,867 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-16 03:39:08,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:39:08,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:39:08,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516510, now seen corresponding path program 1 times [2023-02-16 03:39:08,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:39:08,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118882187] [2023-02-16 03:39:08,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:08,870 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-16 03:39:08,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:39:08,871 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-16 03:39:08,873 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-16 03:39:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:39:08,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:39:08,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:39:08,945 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-16 03:39:08,978 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-16 03:39:08,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:39:08,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:39:08,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118882187] [2023-02-16 03:39:08,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118882187] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:39:08,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:39:08,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:39:08,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464691789] [2023-02-16 03:39:08,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:39:08,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:39:08,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:39:08,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:39:08,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:39:08,984 INFO L87 Difference]: Start difference. First operand 50 states and 61 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-16 03:39:09,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:39:09,124 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2023-02-16 03:39:09,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:39:09,125 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-16 03:39:09,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:39:09,126 INFO L225 Difference]: With dead ends: 49 [2023-02-16 03:39:09,126 INFO L226 Difference]: Without dead ends: 49 [2023-02-16 03:39:09,126 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-16 03:39:09,127 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 60 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:39:09,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 17 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:39:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-16 03:39:09,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2023-02-16 03:39:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 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-16 03:39:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2023-02-16 03:39:09,133 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 6 [2023-02-16 03:39:09,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:39:09,133 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2023-02-16 03:39:09,133 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-16 03:39:09,133 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2023-02-16 03:39:09,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:39:09,134 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:39:09,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:39:09,145 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-16 03:39:09,334 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-16 03:39:09,335 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:39:09,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:39:09,336 INFO L85 PathProgramCache]: Analyzing trace with hash 417959389, now seen corresponding path program 1 times [2023-02-16 03:39:09,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:39:09,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25990800] [2023-02-16 03:39:09,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:09,337 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-16 03:39:09,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:39:09,338 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-16 03:39:09,341 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-16 03:39:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:39:09,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 03:39:09,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:39:09,419 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-16 03:39:09,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:39:09,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:39:09,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25990800] [2023-02-16 03:39:09,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25990800] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:39:09,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:39:09,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:39:09,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730245930] [2023-02-16 03:39:09,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:39:09,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:39:09,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:39:09,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:39:09,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:39:09,422 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:39:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:39:09,528 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2023-02-16 03:39:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:39:09,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-16 03:39:09,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:39:09,529 INFO L225 Difference]: With dead ends: 51 [2023-02-16 03:39:09,529 INFO L226 Difference]: Without dead ends: 51 [2023-02-16 03:39:09,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-16 03:39:09,531 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 58 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:39:09,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 35 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:39:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-16 03:39:09,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2023-02-16 03:39:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 45 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:39:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2023-02-16 03:39:09,535 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 11 [2023-02-16 03:39:09,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:39:09,536 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2023-02-16 03:39:09,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:39:09,536 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2023-02-16 03:39:09,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:39:09,536 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:39:09,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:39:09,551 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-16 03:39:09,751 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-16 03:39:09,753 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:39:09,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:39:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash 71880067, now seen corresponding path program 1 times [2023-02-16 03:39:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:39:09,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206874915] [2023-02-16 03:39:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:09,754 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-16 03:39:09,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:39:09,755 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-16 03:39:09,756 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-16 03:39:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:39:09,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 03:39:09,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:39:09,839 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-16 03:39:09,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-16 03:39:09,894 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-16 03:39:09,915 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-16 03:39:09,915 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:39:09,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:39:09,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206874915] [2023-02-16 03:39:09,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206874915] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:39:09,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:39:09,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:39:09,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421366869] [2023-02-16 03:39:09,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:39:09,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:39:09,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:39:09,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:39:09,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:39:09,925 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:39:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:39:10,182 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2023-02-16 03:39:10,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:39:10,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-16 03:39:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:39:10,184 INFO L225 Difference]: With dead ends: 82 [2023-02-16 03:39:10,184 INFO L226 Difference]: Without dead ends: 82 [2023-02-16 03:39:10,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:39:10,185 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 67 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:39:10,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 91 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:39:10,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-16 03:39:10,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 50. [2023-02-16 03:39:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.394736842105263) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:39:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2023-02-16 03:39:10,190 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 12 [2023-02-16 03:39:10,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:39:10,191 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2023-02-16 03:39:10,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:39:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2023-02-16 03:39:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 03:39:10,192 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:39:10,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:39:10,202 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-16 03:39:10,399 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-16 03:39:10,400 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:39:10,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:39:10,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769707, now seen corresponding path program 1 times [2023-02-16 03:39:10,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:39:10,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474821628] [2023-02-16 03:39:10,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:10,401 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-16 03:39:10,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:39:10,403 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-16 03:39:10,405 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-16 03:39:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:39:10,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 03:39:10,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:39:10,475 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-16 03:39:10,494 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-16 03:39:10,501 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-16 03:39:10,524 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-16 03:39:10,527 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-16 03:39:10,560 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-16 03:39:10,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:39:10,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:39:10,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474821628] [2023-02-16 03:39:10,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474821628] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:39:10,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:39:10,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:39:10,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269521047] [2023-02-16 03:39:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:39:10,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:39:10,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:39:10,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:39:10,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:39:10,563 INFO L87 Difference]: Start difference. First operand 50 states and 53 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-16 03:39:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:39:10,906 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2023-02-16 03:39:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:39:10,907 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-16 03:39:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:39:10,907 INFO L225 Difference]: With dead ends: 60 [2023-02-16 03:39:10,907 INFO L226 Difference]: Without dead ends: 60 [2023-02-16 03:39:10,908 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-16 03:39:10,909 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 34 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:39:10,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 103 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:39:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-16 03:39:10,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2023-02-16 03:39:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 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-16 03:39:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-02-16 03:39:10,912 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2023-02-16 03:39:10,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:39:10,915 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-02-16 03:39:10,916 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-16 03:39:10,916 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-02-16 03:39:10,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 03:39:10,917 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:39:10,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:39:10,925 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-16 03:39:11,125 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-16 03:39:11,125 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:39:11,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:39:11,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769708, now seen corresponding path program 1 times [2023-02-16 03:39:11,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:39:11,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310693729] [2023-02-16 03:39:11,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:11,126 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-16 03:39:11,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:39:11,128 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-16 03:39:11,129 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-16 03:39:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:39:11,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 03:39:11,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:39:11,191 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-16 03:39:11,205 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-16 03:39:11,226 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-16 03:39:11,257 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-16 03:39:11,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:39:11,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:39:11,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310693729] [2023-02-16 03:39:11,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310693729] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:39:11,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:39:11,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:39:11,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885895623] [2023-02-16 03:39:11,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:39:11,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:39:11,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:39:11,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:39:11,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:39:11,264 INFO L87 Difference]: Start difference. First operand 41 states and 44 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-16 03:39:11,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:39:11,464 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2023-02-16 03:39:11,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:39:11,468 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-16 03:39:11,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:39:11,468 INFO L225 Difference]: With dead ends: 54 [2023-02-16 03:39:11,468 INFO L226 Difference]: Without dead ends: 54 [2023-02-16 03:39:11,468 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-16 03:39:11,469 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:39:11,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 85 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:39:11,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-16 03:39:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2023-02-16 03:39:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 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-16 03:39:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2023-02-16 03:39:11,473 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 13 [2023-02-16 03:39:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:39:11,473 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2023-02-16 03:39:11,473 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-16 03:39:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2023-02-16 03:39:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 03:39:11,474 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:39:11,474 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:39:11,483 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-16 03:39:11,674 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-16 03:39:11,675 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:39:11,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:39:11,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1804762195, now seen corresponding path program 1 times [2023-02-16 03:39:11,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:39:11,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995836200] [2023-02-16 03:39:11,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:11,676 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-16 03:39:11,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:39:11,678 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-16 03:39:11,680 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-16 03:39:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:39:11,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 03:39:11,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:39:11,776 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-16 03:39:11,782 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-16 03:39:11,841 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-16 03:39:11,844 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-16 03:39:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:39:11,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:39:11,939 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 27 treesize of output 21 [2023-02-16 03:39:11,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:39:11,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:39:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:39:11,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:39:11,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995836200] [2023-02-16 03:39:11,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995836200] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:39:11,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:39:11,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2023-02-16 03:39:11,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386505110] [2023-02-16 03:39:11,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:39:11,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:39:11,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:39:11,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:39:11,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:39:11,976 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-16 03:39:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:39:12,491 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2023-02-16 03:39:12,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:39:12,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-16 03:39:12,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:39:12,492 INFO L225 Difference]: With dead ends: 53 [2023-02-16 03:39:12,492 INFO L226 Difference]: Without dead ends: 53 [2023-02-16 03:39:12,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:39:12,493 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:39:12,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 79 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:39:12,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-16 03:39:12,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2023-02-16 03:39:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 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-16 03:39:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-02-16 03:39:12,497 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 15 [2023-02-16 03:39:12,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:39:12,497 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-02-16 03:39:12,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-16 03:39:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-02-16 03:39:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:39:12,498 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:39:12,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:39:12,509 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-16 03:39:12,709 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-16 03:39:12,710 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-16 03:39:12,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:39:12,710 INFO L85 PathProgramCache]: Analyzing trace with hash -113054509, now seen corresponding path program 1 times [2023-02-16 03:39:12,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:39:12,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439895135] [2023-02-16 03:39:12,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:39:12,710 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-16 03:39:12,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:39:12,712 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-16 03:39:12,712 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-16 03:39:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 03:39:12,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 03:39:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 03:39:12,840 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-16 03:39:12,841 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 03:39:12,842 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-02-16 03:39:12,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2023-02-16 03:39:12,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-02-16 03:39:12,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-02-16 03:39:12,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-02-16 03:39:12,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-02-16 03:39:12,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-02-16 03:39:12,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-02-16 03:39:12,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-02-16 03:39:12,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-02-16 03:39:12,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2023-02-16 03:39:12,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2023-02-16 03:39:12,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2023-02-16 03:39:12,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (2 of 16 remaining) [2023-02-16 03:39:12,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2023-02-16 03:39:12,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 16 remaining) [2023-02-16 03:39:12,861 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-16 03:39:13,046 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-16 03:39:13,049 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:39:13,051 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 03:39:13,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 03:39:13 BoogieIcfgContainer [2023-02-16 03:39:13,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 03:39:13,067 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 03:39:13,067 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 03:39:13,067 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 03:39:13,067 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:39:08" (3/4) ... [2023-02-16 03:39:13,070 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-16 03:39:13,070 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 03:39:13,070 INFO L158 Benchmark]: Toolchain (without parser) took 6117.63ms. Allocated memory was 62.9MB in the beginning and 96.5MB in the end (delta: 33.6MB). Free memory was 38.7MB in the beginning and 65.1MB in the end (delta: -26.4MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2023-02-16 03:39:13,070 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory was 29.6MB in the beginning and 29.6MB in the end (delta: 54.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:39:13,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.62ms. Allocated memory is still 62.9MB. Free memory was 38.6MB in the beginning and 38.1MB in the end (delta: 428.2kB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-16 03:39:13,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.67ms. Allocated memory is still 62.9MB. Free memory was 37.9MB in the beginning and 36.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:39:13,071 INFO L158 Benchmark]: Boogie Preprocessor took 49.30ms. Allocated memory is still 62.9MB. Free memory was 36.2MB in the beginning and 34.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 03:39:13,072 INFO L158 Benchmark]: RCFGBuilder took 527.32ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 34.5MB in the beginning and 51.1MB in the end (delta: -16.6MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2023-02-16 03:39:13,072 INFO L158 Benchmark]: TraceAbstraction took 5005.51ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 50.4MB in the beginning and 65.7MB in the end (delta: -15.3MB). Peak memory consumption was 983.7kB. Max. memory is 16.1GB. [2023-02-16 03:39:13,072 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 96.5MB. Free memory was 65.7MB in the beginning and 65.1MB in the end (delta: 529.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:39:13,074 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.19ms. Allocated memory is still 52.4MB. Free memory was 29.6MB in the beginning and 29.6MB in the end (delta: 54.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.62ms. Allocated memory is still 62.9MB. Free memory was 38.6MB in the beginning and 38.1MB in the end (delta: 428.2kB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.67ms. Allocated memory is still 62.9MB. Free memory was 37.9MB in the beginning and 36.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.30ms. Allocated memory is still 62.9MB. Free memory was 36.2MB in the beginning and 34.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 527.32ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 34.5MB in the beginning and 51.1MB in the end (delta: -16.6MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5005.51ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 50.4MB in the beginning and 65.7MB in the end (delta: -15.3MB). Peak memory consumption was 983.7kB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 96.5MB. Free memory was 65.7MB in the beginning and 65.1MB in the end (delta: 529.1kB). 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={6:0}] [L534] List t; [L535] List p = a; VAL [a={6:0}, p={6:0}] [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] p->h = 1 VAL [a={6:0}, p={6:0}] [L544] p->n = 0 VAL [a={6:0}, p={6:0}] [L545] p = a VAL [a={6:0}, p={6:0}] [L546] COND TRUE p!=0 VAL [a={6:0}, p={6:0}] [L547] EXPR p->h VAL [a={6:0}, p={6:0}, p->h=1] [L547] COND FALSE !(p->h != 1) [L550] EXPR p->n VAL [a={6:0}, p={6:0}, p->n={0:0}] [L550] p = p->n [L546] COND FALSE !(p!=0) VAL [a={6:0}, p={0:0}] [L552] return 0; VAL [\result=0, a={6:0}, p={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 379 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 379 mSDsluCounter, 444 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 527 IncrementalHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 167 mSDtfsCounter, 527 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=1, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 102 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 547 SizeOfPredicates, 34 NumberOfNonLiveVariables, 387 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 4/6 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-16 03:39:13,091 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