./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 20:23:24,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 20:23:24,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 20:23:24,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 20:23:24,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 20:23:24,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 20:23:24,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 20:23:24,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 20:23:24,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 20:23:24,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 20:23:24,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 20:23:24,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 20:23:24,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 20:23:24,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 20:23:24,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 20:23:24,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 20:23:24,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 20:23:24,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 20:23:24,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 20:23:24,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 20:23:24,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 20:23:24,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 20:23:24,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 20:23:24,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 20:23:24,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 20:23:24,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 20:23:24,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 20:23:24,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 20:23:24,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 20:23:24,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 20:23:24,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 20:23:24,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 20:23:24,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 20:23:24,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 20:23:24,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 20:23:24,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 20:23:24,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 20:23:24,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 20:23:24,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 20:23:24,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 20:23:24,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 20:23:24,305 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-18 20:23:24,329 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 20:23:24,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 20:23:24,334 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 20:23:24,335 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 20:23:24,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 20:23:24,336 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 20:23:24,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 20:23:24,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 20:23:24,336 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 20:23:24,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 20:23:24,337 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 20:23:24,337 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 20:23:24,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 20:23:24,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 20:23:24,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 20:23:24,338 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-18 20:23:24,338 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-18 20:23:24,338 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-18 20:23:24,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 20:23:24,339 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 20:23:24,339 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 20:23:24,339 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 20:23:24,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 20:23:24,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 20:23:24,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 20:23:24,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 20:23:24,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 20:23:24,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 20:23:24,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 20:23:24,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 20:23:24,341 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 20:23:24,341 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 20:23:24,341 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 20:23:24,341 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 20:23:24,341 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 -> f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f [2023-02-18 20:23:24,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 20:23:24,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 20:23:24,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 20:23:24,539 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 20:23:24,539 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 20:23:24,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.1.i [2023-02-18 20:23:25,555 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 20:23:25,771 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 20:23:25,771 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.1.i [2023-02-18 20:23:25,780 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd1edb4c/4cbe7021d32249d2864b31bc1e256b05/FLAG537b8737f [2023-02-18 20:23:25,799 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd1edb4c/4cbe7021d32249d2864b31bc1e256b05 [2023-02-18 20:23:25,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 20:23:25,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 20:23:25,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 20:23:25,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 20:23:25,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 20:23:25,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 08:23:25" (1/1) ... [2023-02-18 20:23:25,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@155254d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:25, skipping insertion in model container [2023-02-18 20:23:25,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 08:23:25" (1/1) ... [2023-02-18 20:23:25,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 20:23:25,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 20:23:26,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 20:23:26,014 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 20:23:26,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 20:23:26,057 INFO L208 MainTranslator]: Completed translation [2023-02-18 20:23:26,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:26 WrapperNode [2023-02-18 20:23:26,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 20:23:26,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 20:23:26,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 20:23:26,058 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 20:23:26,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:26" (1/1) ... [2023-02-18 20:23:26,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:26" (1/1) ... [2023-02-18 20:23:26,093 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2023-02-18 20:23:26,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 20:23:26,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 20:23:26,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 20:23:26,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 20:23:26,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:26" (1/1) ... [2023-02-18 20:23:26,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:26" (1/1) ... [2023-02-18 20:23:26,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:26" (1/1) ... [2023-02-18 20:23:26,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:26" (1/1) ... [2023-02-18 20:23:26,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:26" (1/1) ... [2023-02-18 20:23:26,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:26" (1/1) ... [2023-02-18 20:23:26,128 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:26" (1/1) ... [2023-02-18 20:23:26,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:26" (1/1) ... [2023-02-18 20:23:26,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 20:23:26,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 20:23:26,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 20:23:26,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 20:23:26,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:26" (1/1) ... [2023-02-18 20:23:26,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 20:23:26,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 20:23:26,207 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-18 20:23:26,221 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-18 20:23:26,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-18 20:23:26,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-18 20:23:26,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-18 20:23:26,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 20:23:26,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-18 20:23:26,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-18 20:23:26,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-18 20:23:26,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 20:23:26,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 20:23:26,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 20:23:26,327 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 20:23:26,329 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 20:23:26,533 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 20:23:26,539 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 20:23:26,539 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 20:23:26,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 08:23:26 BoogieIcfgContainer [2023-02-18 20:23:26,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 20:23:26,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 20:23:26,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 20:23:26,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 20:23:26,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 08:23:25" (1/3) ... [2023-02-18 20:23:26,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a616b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 08:23:26, skipping insertion in model container [2023-02-18 20:23:26,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:26" (2/3) ... [2023-02-18 20:23:26,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a616b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 08:23:26, skipping insertion in model container [2023-02-18 20:23:26,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 08:23:26" (3/3) ... [2023-02-18 20:23:26,547 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2023-02-18 20:23:26,559 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 20:23:26,560 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2023-02-18 20:23:26,591 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 20:23:26,595 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;@6f129c29, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 20:23:26,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-02-18 20:23:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 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-18 20:23:26,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-18 20:23:26,603 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:26,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-18 20:23:26,604 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:26,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:26,608 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2023-02-18 20:23:26,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:26,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697978745] [2023-02-18 20:23:26,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:26,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:26,701 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-18 20:23:26,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:26,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697978745] [2023-02-18 20:23:26,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697978745] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:26,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:26,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 20:23:26,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919832312] [2023-02-18 20:23:26,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:26,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 20:23:26,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:26,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 20:23:26,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 20:23:26,726 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.930232558139535) internal successors, (83), 63 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:26,745 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2023-02-18 20:23:26,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 20:23:26,747 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-18 20:23:26,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:26,754 INFO L225 Difference]: With dead ends: 64 [2023-02-18 20:23:26,755 INFO L226 Difference]: Without dead ends: 62 [2023-02-18 20:23:26,757 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-18 20:23:26,762 INFO L413 NwaCegarLoop]: 81 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, 81 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-18 20:23:26,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:26,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-18 20:23:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-02-18 20:23:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2023-02-18 20:23:26,798 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2023-02-18 20:23:26,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:26,798 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2023-02-18 20:23:26,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:26,798 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2023-02-18 20:23:26,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-18 20:23:26,799 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:26,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:26,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 20:23:26,799 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:26,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:26,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2023-02-18 20:23:26,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:26,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801815422] [2023-02-18 20:23:26,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:26,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:26,856 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-18 20:23:26,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:26,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801815422] [2023-02-18 20:23:26,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801815422] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:26,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:26,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 20:23:26,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24508759] [2023-02-18 20:23:26,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:26,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 20:23:26,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:26,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 20:23:26,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:26,862 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-18 20:23:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:26,885 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2023-02-18 20:23:26,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 20:23:26,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-18 20:23:26,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:26,887 INFO L225 Difference]: With dead ends: 63 [2023-02-18 20:23:26,887 INFO L226 Difference]: Without dead ends: 63 [2023-02-18 20:23:26,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:26,888 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:26,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-18 20:23:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-18 20:23:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2023-02-18 20:23:26,896 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2023-02-18 20:23:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:26,897 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2023-02-18 20:23:26,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-18 20:23:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2023-02-18 20:23:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-18 20:23:26,898 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:26,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:26,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 20:23:26,899 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:26,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:26,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2023-02-18 20:23:26,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:26,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576022747] [2023-02-18 20:23:26,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:26,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:26,976 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-18 20:23:26,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:26,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576022747] [2023-02-18 20:23:26,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576022747] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:26,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:26,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 20:23:26,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040989220] [2023-02-18 20:23:26,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:26,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 20:23:26,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:26,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 20:23:26,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:26,980 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-18 20:23:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:27,010 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2023-02-18 20:23:27,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 20:23:27,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-18 20:23:27,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:27,012 INFO L225 Difference]: With dead ends: 111 [2023-02-18 20:23:27,012 INFO L226 Difference]: Without dead ends: 111 [2023-02-18 20:23:27,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:27,013 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:27,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-18 20:23:27,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2023-02-18 20:23:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 92 states have internal predecessors, (137), 0 states have call successors, (0), 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-18 20:23:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2023-02-18 20:23:27,020 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 7 [2023-02-18 20:23:27,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:27,021 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2023-02-18 20:23:27,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-18 20:23:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2023-02-18 20:23:27,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 20:23:27,021 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:27,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:27,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 20:23:27,022 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:27,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:27,023 INFO L85 PathProgramCache]: Analyzing trace with hash 177749355, now seen corresponding path program 1 times [2023-02-18 20:23:27,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:27,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417013481] [2023-02-18 20:23:27,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:27,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:27,071 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-18 20:23:27,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:27,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417013481] [2023-02-18 20:23:27,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417013481] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:27,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:27,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 20:23:27,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460581549] [2023-02-18 20:23:27,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:27,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 20:23:27,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:27,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 20:23:27,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 20:23:27,079 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:27,102 INFO L93 Difference]: Finished difference Result 101 states and 146 transitions. [2023-02-18 20:23:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 20:23:27,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-18 20:23:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:27,103 INFO L225 Difference]: With dead ends: 101 [2023-02-18 20:23:27,104 INFO L226 Difference]: Without dead ends: 101 [2023-02-18 20:23:27,104 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-18 20:23:27,105 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:27,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 215 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:27,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-18 20:23:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2023-02-18 20:23:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 94 states have internal predecessors, (139), 0 states have call successors, (0), 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-18 20:23:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2023-02-18 20:23:27,111 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 8 [2023-02-18 20:23:27,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:27,111 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2023-02-18 20:23:27,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2023-02-18 20:23:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 20:23:27,112 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:27,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:27,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 20:23:27,112 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:27,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:27,117 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2023-02-18 20:23:27,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:27,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735518933] [2023-02-18 20:23:27,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:27,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:27,139 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-18 20:23:27,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:27,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735518933] [2023-02-18 20:23:27,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735518933] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:27,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:27,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 20:23:27,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711227101] [2023-02-18 20:23:27,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:27,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 20:23:27,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:27,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 20:23:27,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:27,142 INFO L87 Difference]: Start difference. First operand 95 states and 139 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:27,182 INFO L93 Difference]: Finished difference Result 177 states and 261 transitions. [2023-02-18 20:23:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 20:23:27,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-18 20:23:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:27,184 INFO L225 Difference]: With dead ends: 177 [2023-02-18 20:23:27,184 INFO L226 Difference]: Without dead ends: 174 [2023-02-18 20:23:27,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:27,185 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:27,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-18 20:23:27,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 153. [2023-02-18 20:23:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 133 states have (on average 1.849624060150376) internal successors, (246), 152 states have internal predecessors, (246), 0 states have call successors, (0), 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-18 20:23:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 246 transitions. [2023-02-18 20:23:27,193 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 246 transitions. Word has length 8 [2023-02-18 20:23:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:27,193 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 246 transitions. [2023-02-18 20:23:27,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2023-02-18 20:23:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 20:23:27,194 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:27,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:27,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 20:23:27,194 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:27,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:27,195 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2023-02-18 20:23:27,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:27,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668016711] [2023-02-18 20:23:27,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:27,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:27,235 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-18 20:23:27,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:27,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668016711] [2023-02-18 20:23:27,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668016711] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:27,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:27,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 20:23:27,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782911478] [2023-02-18 20:23:27,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:27,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 20:23:27,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:27,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 20:23:27,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:27,238 INFO L87 Difference]: Start difference. First operand 153 states and 246 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:27,279 INFO L93 Difference]: Finished difference Result 229 states and 354 transitions. [2023-02-18 20:23:27,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 20:23:27,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-18 20:23:27,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:27,281 INFO L225 Difference]: With dead ends: 229 [2023-02-18 20:23:27,281 INFO L226 Difference]: Without dead ends: 229 [2023-02-18 20:23:27,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:27,282 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:27,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 172 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:27,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-02-18 20:23:27,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 208. [2023-02-18 20:23:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 190 states have (on average 1.7894736842105263) internal successors, (340), 207 states have internal predecessors, (340), 0 states have call successors, (0), 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-18 20:23:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 340 transitions. [2023-02-18 20:23:27,291 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 340 transitions. Word has length 8 [2023-02-18 20:23:27,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:27,291 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 340 transitions. [2023-02-18 20:23:27,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 340 transitions. [2023-02-18 20:23:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 20:23:27,292 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:27,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:27,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-18 20:23:27,293 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:27,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:27,293 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2023-02-18 20:23:27,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:27,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271723992] [2023-02-18 20:23:27,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:27,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:27,346 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-18 20:23:27,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:27,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271723992] [2023-02-18 20:23:27,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271723992] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:27,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:27,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 20:23:27,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169155395] [2023-02-18 20:23:27,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:27,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 20:23:27,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:27,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 20:23:27,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:27,348 INFO L87 Difference]: Start difference. First operand 208 states and 340 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:27,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:27,381 INFO L93 Difference]: Finished difference Result 224 states and 345 transitions. [2023-02-18 20:23:27,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 20:23:27,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-18 20:23:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:27,383 INFO L225 Difference]: With dead ends: 224 [2023-02-18 20:23:27,383 INFO L226 Difference]: Without dead ends: 224 [2023-02-18 20:23:27,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:27,384 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:27,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:27,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-02-18 20:23:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 206. [2023-02-18 20:23:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 190 states have (on average 1.7473684210526317) internal successors, (332), 205 states have internal predecessors, (332), 0 states have call successors, (0), 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-18 20:23:27,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 332 transitions. [2023-02-18 20:23:27,391 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 332 transitions. Word has length 8 [2023-02-18 20:23:27,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:27,391 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 332 transitions. [2023-02-18 20:23:27,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:27,391 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 332 transitions. [2023-02-18 20:23:27,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 20:23:27,392 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:27,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:27,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 20:23:27,392 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:27,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:27,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2023-02-18 20:23:27,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:27,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632183813] [2023-02-18 20:23:27,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:27,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:27,430 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-18 20:23:27,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:27,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632183813] [2023-02-18 20:23:27,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632183813] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:27,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:27,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 20:23:27,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58262677] [2023-02-18 20:23:27,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:27,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 20:23:27,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:27,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 20:23:27,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 20:23:27,432 INFO L87 Difference]: Start difference. First operand 206 states and 332 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-18 20:23:27,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:27,465 INFO L93 Difference]: Finished difference Result 445 states and 675 transitions. [2023-02-18 20:23:27,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 20:23:27,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2023-02-18 20:23:27,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:27,467 INFO L225 Difference]: With dead ends: 445 [2023-02-18 20:23:27,467 INFO L226 Difference]: Without dead ends: 445 [2023-02-18 20:23:27,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 20:23:27,468 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 105 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:27,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 360 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2023-02-18 20:23:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 354. [2023-02-18 20:23:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 338 states have (on average 1.680473372781065) internal successors, (568), 353 states have internal predecessors, (568), 0 states have call successors, (0), 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-18 20:23:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 568 transitions. [2023-02-18 20:23:27,477 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 568 transitions. Word has length 9 [2023-02-18 20:23:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:27,477 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 568 transitions. [2023-02-18 20:23:27,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-18 20:23:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 568 transitions. [2023-02-18 20:23:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-18 20:23:27,478 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:27,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:27,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-18 20:23:27,479 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:27,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:27,479 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2023-02-18 20:23:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:27,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025264943] [2023-02-18 20:23:27,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:27,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:27,507 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-18 20:23:27,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:27,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025264943] [2023-02-18 20:23:27,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025264943] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:27,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:27,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 20:23:27,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511874401] [2023-02-18 20:23:27,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:27,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 20:23:27,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:27,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 20:23:27,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 20:23:27,509 INFO L87 Difference]: Start difference. First operand 354 states and 568 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:27,542 INFO L93 Difference]: Finished difference Result 826 states and 1228 transitions. [2023-02-18 20:23:27,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 20:23:27,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-18 20:23:27,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:27,545 INFO L225 Difference]: With dead ends: 826 [2023-02-18 20:23:27,545 INFO L226 Difference]: Without dead ends: 826 [2023-02-18 20:23:27,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 20:23:27,546 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 93 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:27,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 353 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:27,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2023-02-18 20:23:27,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 594. [2023-02-18 20:23:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 578 states have (on average 1.5778546712802768) internal successors, (912), 593 states have internal predecessors, (912), 0 states have call successors, (0), 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-18 20:23:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 912 transitions. [2023-02-18 20:23:27,559 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 912 transitions. Word has length 10 [2023-02-18 20:23:27,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:27,559 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 912 transitions. [2023-02-18 20:23:27,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:27,560 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 912 transitions. [2023-02-18 20:23:27,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 20:23:27,561 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:27,561 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:27,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-18 20:23:27,562 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:27,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:27,563 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2023-02-18 20:23:27,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:27,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016727130] [2023-02-18 20:23:27,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:27,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:27,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:27,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016727130] [2023-02-18 20:23:27,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016727130] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:27,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:27,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 20:23:27,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691402615] [2023-02-18 20:23:27,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:27,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 20:23:27,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:27,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 20:23:27,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 20:23:27,621 INFO L87 Difference]: Start difference. First operand 594 states and 912 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-18 20:23:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:27,651 INFO L93 Difference]: Finished difference Result 906 states and 1406 transitions. [2023-02-18 20:23:27,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 20:23:27,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-18 20:23:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:27,654 INFO L225 Difference]: With dead ends: 906 [2023-02-18 20:23:27,654 INFO L226 Difference]: Without dead ends: 906 [2023-02-18 20:23:27,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-18 20:23:27,655 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 99 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:27,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 279 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:27,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2023-02-18 20:23:27,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 888. [2023-02-18 20:23:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 872 states have (on average 1.603211009174312) internal successors, (1398), 887 states have internal predecessors, (1398), 0 states have call successors, (0), 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-18 20:23:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1398 transitions. [2023-02-18 20:23:27,667 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1398 transitions. Word has length 16 [2023-02-18 20:23:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:27,667 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 1398 transitions. [2023-02-18 20:23:27,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-18 20:23:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1398 transitions. [2023-02-18 20:23:27,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 20:23:27,668 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:27,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:27,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-18 20:23:27,669 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:27,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:27,669 INFO L85 PathProgramCache]: Analyzing trace with hash 617603772, now seen corresponding path program 1 times [2023-02-18 20:23:27,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:27,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911105549] [2023-02-18 20:23:27,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:27,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:27,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:27,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911105549] [2023-02-18 20:23:27,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911105549] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 20:23:27,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863980781] [2023-02-18 20:23:27,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:27,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 20:23:27,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 20:23:27,710 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-18 20:23:27,730 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-18 20:23:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:27,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 20:23:27,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:27,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:27,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863980781] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:27,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 20:23:27,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-02-18 20:23:27,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18434825] [2023-02-18 20:23:27,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:27,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 20:23:27,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:27,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 20:23:27,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-18 20:23:27,880 INFO L87 Difference]: Start difference. First operand 888 states and 1398 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-18 20:23:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:27,966 INFO L93 Difference]: Finished difference Result 2236 states and 3388 transitions. [2023-02-18 20:23:27,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 20:23:27,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-18 20:23:27,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:27,973 INFO L225 Difference]: With dead ends: 2236 [2023-02-18 20:23:27,974 INFO L226 Difference]: Without dead ends: 2236 [2023-02-18 20:23:27,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2023-02-18 20:23:27,975 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 359 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:27,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 543 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 20:23:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2023-02-18 20:23:27,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 1272. [2023-02-18 20:23:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1256 states have (on average 1.5684713375796178) internal successors, (1970), 1271 states have internal predecessors, (1970), 0 states have call successors, (0), 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-18 20:23:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1970 transitions. [2023-02-18 20:23:27,998 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1970 transitions. Word has length 16 [2023-02-18 20:23:27,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:27,999 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1970 transitions. [2023-02-18 20:23:27,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-18 20:23:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1970 transitions. [2023-02-18 20:23:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 20:23:28,001 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:28,002 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:28,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 20:23:28,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-18 20:23:28,208 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:28,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:28,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1214108262, now seen corresponding path program 1 times [2023-02-18 20:23:28,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:28,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778646679] [2023-02-18 20:23:28,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:28,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 20:23:28,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:28,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778646679] [2023-02-18 20:23:28,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778646679] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:28,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:28,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 20:23:28,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440165515] [2023-02-18 20:23:28,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:28,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 20:23:28,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:28,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 20:23:28,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 20:23:28,246 INFO L87 Difference]: Start difference. First operand 1272 states and 1970 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:28,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:28,271 INFO L93 Difference]: Finished difference Result 473 states and 648 transitions. [2023-02-18 20:23:28,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 20:23:28,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-18 20:23:28,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:28,273 INFO L225 Difference]: With dead ends: 473 [2023-02-18 20:23:28,273 INFO L226 Difference]: Without dead ends: 473 [2023-02-18 20:23:28,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 20:23:28,273 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 106 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:28,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 243 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-02-18 20:23:28,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 353. [2023-02-18 20:23:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 341 states have (on average 1.501466275659824) internal successors, (512), 352 states have internal predecessors, (512), 0 states have call successors, (0), 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-18 20:23:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 512 transitions. [2023-02-18 20:23:28,279 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 512 transitions. Word has length 21 [2023-02-18 20:23:28,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:28,280 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 512 transitions. [2023-02-18 20:23:28,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:28,280 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 512 transitions. [2023-02-18 20:23:28,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 20:23:28,281 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:28,281 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:28,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-18 20:23:28,281 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:28,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:28,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1692627395, now seen corresponding path program 1 times [2023-02-18 20:23:28,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:28,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501811532] [2023-02-18 20:23:28,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:28,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:28,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:28,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501811532] [2023-02-18 20:23:28,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501811532] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 20:23:28,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607626091] [2023-02-18 20:23:28,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:28,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 20:23:28,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 20:23:28,323 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 20:23:28,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 20:23:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:28,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 20:23:28,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:28,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:28,423 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:28,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607626091] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:28,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 20:23:28,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-02-18 20:23:28,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880468262] [2023-02-18 20:23:28,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:28,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 20:23:28,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:28,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 20:23:28,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 20:23:28,425 INFO L87 Difference]: Start difference. First operand 353 states and 512 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:28,475 INFO L93 Difference]: Finished difference Result 1047 states and 1508 transitions. [2023-02-18 20:23:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 20:23:28,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-18 20:23:28,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:28,478 INFO L225 Difference]: With dead ends: 1047 [2023-02-18 20:23:28,478 INFO L226 Difference]: Without dead ends: 1047 [2023-02-18 20:23:28,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 20:23:28,479 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 176 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:28,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 159 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2023-02-18 20:23:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1007. [2023-02-18 20:23:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 995 states have (on average 1.485427135678392) internal successors, (1478), 1006 states have internal predecessors, (1478), 0 states have call successors, (0), 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-18 20:23:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1478 transitions. [2023-02-18 20:23:28,499 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1478 transitions. Word has length 24 [2023-02-18 20:23:28,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:28,499 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1478 transitions. [2023-02-18 20:23:28,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1478 transitions. [2023-02-18 20:23:28,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-18 20:23:28,500 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:28,500 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:28,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 20:23:28,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-18 20:23:28,706 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:28,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:28,707 INFO L85 PathProgramCache]: Analyzing trace with hash -6965384, now seen corresponding path program 1 times [2023-02-18 20:23:28,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:28,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540192502] [2023-02-18 20:23:28,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:28,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:28,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:28,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540192502] [2023-02-18 20:23:28,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540192502] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 20:23:28,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34902147] [2023-02-18 20:23:28,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:28,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 20:23:28,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 20:23:28,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 20:23:28,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 20:23:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:28,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 20:23:28,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:28,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:28,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34902147] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:28,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 20:23:28,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2023-02-18 20:23:28,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663899765] [2023-02-18 20:23:28,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:28,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 20:23:28,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:28,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 20:23:28,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-18 20:23:28,925 INFO L87 Difference]: Start difference. First operand 1007 states and 1478 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 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-18 20:23:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:29,041 INFO L93 Difference]: Finished difference Result 3857 states and 5384 transitions. [2023-02-18 20:23:29,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-18 20:23:29,042 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 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) Word has length 27 [2023-02-18 20:23:29,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:29,051 INFO L225 Difference]: With dead ends: 3857 [2023-02-18 20:23:29,051 INFO L226 Difference]: Without dead ends: 3857 [2023-02-18 20:23:29,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2023-02-18 20:23:29,052 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 625 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:29,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 535 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 20:23:29,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2023-02-18 20:23:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 2177. [2023-02-18 20:23:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2177 states, 2165 states have (on average 1.464203233256351) internal successors, (3170), 2176 states have internal predecessors, (3170), 0 states have call successors, (0), 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-18 20:23:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 2177 states and 3170 transitions. [2023-02-18 20:23:29,087 INFO L78 Accepts]: Start accepts. Automaton has 2177 states and 3170 transitions. Word has length 27 [2023-02-18 20:23:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:29,087 INFO L495 AbstractCegarLoop]: Abstraction has 2177 states and 3170 transitions. [2023-02-18 20:23:29,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 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-18 20:23:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 3170 transitions. [2023-02-18 20:23:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-18 20:23:29,088 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:29,088 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:29,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 20:23:29,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 20:23:29,294 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:29,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:29,295 INFO L85 PathProgramCache]: Analyzing trace with hash 554127938, now seen corresponding path program 1 times [2023-02-18 20:23:29,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:29,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401727343] [2023-02-18 20:23:29,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:29,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 20:23:29,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:29,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401727343] [2023-02-18 20:23:29,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401727343] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 20:23:29,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159065206] [2023-02-18 20:23:29,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:29,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 20:23:29,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 20:23:29,372 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 20:23:29,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 20:23:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:29,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 20:23:29,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 20:23:29,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 20:23:29,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159065206] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:29,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 20:23:29,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-02-18 20:23:29,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057964425] [2023-02-18 20:23:29,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:29,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 20:23:29,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:29,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 20:23:29,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-18 20:23:29,533 INFO L87 Difference]: Start difference. First operand 2177 states and 3170 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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-18 20:23:29,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:29,630 INFO L93 Difference]: Finished difference Result 1889 states and 2651 transitions. [2023-02-18 20:23:29,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 20:23:29,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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 27 [2023-02-18 20:23:29,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:29,635 INFO L225 Difference]: With dead ends: 1889 [2023-02-18 20:23:29,636 INFO L226 Difference]: Without dead ends: 1889 [2023-02-18 20:23:29,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-02-18 20:23:29,653 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 455 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:29,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 553 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2023-02-18 20:23:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 831. [2023-02-18 20:23:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 819 states have (on average 1.468864468864469) internal successors, (1203), 830 states have internal predecessors, (1203), 0 states have call successors, (0), 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-18 20:23:29,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1203 transitions. [2023-02-18 20:23:29,669 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1203 transitions. Word has length 27 [2023-02-18 20:23:29,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:29,683 INFO L495 AbstractCegarLoop]: Abstraction has 831 states and 1203 transitions. [2023-02-18 20:23:29,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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-18 20:23:29,683 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1203 transitions. [2023-02-18 20:23:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-18 20:23:29,686 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:29,686 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:29,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 20:23:29,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-18 20:23:29,886 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:29,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:29,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2001409998, now seen corresponding path program 1 times [2023-02-18 20:23:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:29,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300883280] [2023-02-18 20:23:29,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:29,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-18 20:23:30,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:30,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300883280] [2023-02-18 20:23:30,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300883280] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 20:23:30,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038174049] [2023-02-18 20:23:30,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:30,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 20:23:30,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 20:23:30,043 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 20:23:30,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 20:23:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:30,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 20:23:30,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:30,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:30,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038174049] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:30,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 20:23:30,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2023-02-18 20:23:30,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702604624] [2023-02-18 20:23:30,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:30,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 20:23:30,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:30,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 20:23:30,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-02-18 20:23:30,206 INFO L87 Difference]: Start difference. First operand 831 states and 1203 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:30,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:30,369 INFO L93 Difference]: Finished difference Result 3249 states and 4495 transitions. [2023-02-18 20:23:30,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-18 20:23:30,369 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-02-18 20:23:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:30,377 INFO L225 Difference]: With dead ends: 3249 [2023-02-18 20:23:30,378 INFO L226 Difference]: Without dead ends: 3249 [2023-02-18 20:23:30,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 97 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2023-02-18 20:23:30,378 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 1387 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:30,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 888 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 20:23:30,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2023-02-18 20:23:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 1101. [2023-02-18 20:23:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1089 states have (on average 1.45821854912764) internal successors, (1588), 1100 states have internal predecessors, (1588), 0 states have call successors, (0), 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-18 20:23:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1588 transitions. [2023-02-18 20:23:30,399 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1588 transitions. Word has length 51 [2023-02-18 20:23:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:30,399 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1588 transitions. [2023-02-18 20:23:30,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:30,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1588 transitions. [2023-02-18 20:23:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-18 20:23:30,400 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:30,400 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:30,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 20:23:30,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-18 20:23:30,624 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:30,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1426339750, now seen corresponding path program 1 times [2023-02-18 20:23:30,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:30,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249270292] [2023-02-18 20:23:30,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:30,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-02-18 20:23:30,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:30,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249270292] [2023-02-18 20:23:30,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249270292] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 20:23:30,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599755013] [2023-02-18 20:23:30,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:30,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 20:23:30,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 20:23:30,759 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 20:23:30,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 20:23:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:30,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 20:23:30,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-18 20:23:30,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-18 20:23:30,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599755013] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 20:23:30,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-18 20:23:30,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2023-02-18 20:23:30,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951427324] [2023-02-18 20:23:30,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:30,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 20:23:30,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:30,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 20:23:30,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-18 20:23:30,923 INFO L87 Difference]: Start difference. First operand 1101 states and 1588 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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-18 20:23:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:30,989 INFO L93 Difference]: Finished difference Result 2427 states and 3410 transitions. [2023-02-18 20:23:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 20:23:30,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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) Word has length 59 [2023-02-18 20:23:30,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:30,996 INFO L225 Difference]: With dead ends: 2427 [2023-02-18 20:23:30,996 INFO L226 Difference]: Without dead ends: 2427 [2023-02-18 20:23:30,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-02-18 20:23:30,997 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 250 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:30,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 489 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:30,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2023-02-18 20:23:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 1749. [2023-02-18 20:23:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1749 states, 1737 states have (on average 1.4352331606217616) internal successors, (2493), 1748 states have internal predecessors, (2493), 0 states have call successors, (0), 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-18 20:23:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2493 transitions. [2023-02-18 20:23:31,019 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2493 transitions. Word has length 59 [2023-02-18 20:23:31,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:31,019 INFO L495 AbstractCegarLoop]: Abstraction has 1749 states and 2493 transitions. [2023-02-18 20:23:31,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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-18 20:23:31,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2493 transitions. [2023-02-18 20:23:31,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-18 20:23:31,021 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:31,021 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:31,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 20:23:31,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-18 20:23:31,227 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:31,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:31,227 INFO L85 PathProgramCache]: Analyzing trace with hash -443713253, now seen corresponding path program 1 times [2023-02-18 20:23:31,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:31,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281206981] [2023-02-18 20:23:31,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:31,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 49 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-18 20:23:31,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:31,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281206981] [2023-02-18 20:23:31,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281206981] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 20:23:31,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625346372] [2023-02-18 20:23:31,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:31,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 20:23:31,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 20:23:31,299 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 20:23:31,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 20:23:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:31,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 20:23:31,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-18 20:23:31,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-18 20:23:31,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625346372] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:31,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 20:23:31,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 12 [2023-02-18 20:23:31,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414334709] [2023-02-18 20:23:31,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:31,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 20:23:31,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:31,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 20:23:31,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-02-18 20:23:31,442 INFO L87 Difference]: Start difference. First operand 1749 states and 2493 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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-18 20:23:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:32,224 INFO L93 Difference]: Finished difference Result 9755 states and 13739 transitions. [2023-02-18 20:23:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-18 20:23:32,225 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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 59 [2023-02-18 20:23:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:32,249 INFO L225 Difference]: With dead ends: 9755 [2023-02-18 20:23:32,249 INFO L226 Difference]: Without dead ends: 9755 [2023-02-18 20:23:32,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 137 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=631, Invalid=2021, Unknown=0, NotChecked=0, Total=2652 [2023-02-18 20:23:32,250 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 1015 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:32,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 902 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 20:23:32,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9755 states. [2023-02-18 20:23:32,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9755 to 4918. [2023-02-18 20:23:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4918 states, 4907 states have (on average 1.4634196046464234) internal successors, (7181), 4917 states have internal predecessors, (7181), 0 states have call successors, (0), 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-18 20:23:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4918 states to 4918 states and 7181 transitions. [2023-02-18 20:23:32,337 INFO L78 Accepts]: Start accepts. Automaton has 4918 states and 7181 transitions. Word has length 59 [2023-02-18 20:23:32,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:32,337 INFO L495 AbstractCegarLoop]: Abstraction has 4918 states and 7181 transitions. [2023-02-18 20:23:32,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 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-18 20:23:32,337 INFO L276 IsEmpty]: Start isEmpty. Operand 4918 states and 7181 transitions. [2023-02-18 20:23:32,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-18 20:23:32,338 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:32,339 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:32,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 20:23:32,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 20:23:32,544 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:32,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:32,545 INFO L85 PathProgramCache]: Analyzing trace with hash -791217300, now seen corresponding path program 1 times [2023-02-18 20:23:32,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:32,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327782347] [2023-02-18 20:23:32,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:32,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-02-18 20:23:32,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:32,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327782347] [2023-02-18 20:23:32,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327782347] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 20:23:32,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306719993] [2023-02-18 20:23:32,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:32,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 20:23:32,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 20:23:32,646 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 20:23:32,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 20:23:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:32,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 20:23:32,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 101 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 20:23:32,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 103 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 20:23:32,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306719993] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:32,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 20:23:32,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2023-02-18 20:23:32,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329474837] [2023-02-18 20:23:32,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:32,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 20:23:32,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:32,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 20:23:32,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-02-18 20:23:32,789 INFO L87 Difference]: Start difference. First operand 4918 states and 7181 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 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-18 20:23:33,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:33,059 INFO L93 Difference]: Finished difference Result 10540 states and 15062 transitions. [2023-02-18 20:23:33,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-18 20:23:33,060 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 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 63 [2023-02-18 20:23:33,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:33,075 INFO L225 Difference]: With dead ends: 10540 [2023-02-18 20:23:33,075 INFO L226 Difference]: Without dead ends: 10540 [2023-02-18 20:23:33,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 132 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2023-02-18 20:23:33,076 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 967 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:33,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1571 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 20:23:33,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10540 states. [2023-02-18 20:23:33,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10540 to 4718. [2023-02-18 20:23:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4718 states, 4707 states have (on average 1.4418950499256427) internal successors, (6787), 4717 states have internal predecessors, (6787), 0 states have call successors, (0), 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-18 20:23:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4718 states to 4718 states and 6787 transitions. [2023-02-18 20:23:33,173 INFO L78 Accepts]: Start accepts. Automaton has 4718 states and 6787 transitions. Word has length 63 [2023-02-18 20:23:33,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:33,174 INFO L495 AbstractCegarLoop]: Abstraction has 4718 states and 6787 transitions. [2023-02-18 20:23:33,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 0 states have call successors, (0), 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-18 20:23:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 4718 states and 6787 transitions. [2023-02-18 20:23:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-18 20:23:33,175 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:33,175 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:33,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-18 20:23:33,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 20:23:33,381 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:33,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:33,381 INFO L85 PathProgramCache]: Analyzing trace with hash 767429099, now seen corresponding path program 1 times [2023-02-18 20:23:33,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:33,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024147033] [2023-02-18 20:23:33,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:33,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 72 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 20:23:33,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 20:23:33,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024147033] [2023-02-18 20:23:33,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024147033] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 20:23:33,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361780906] [2023-02-18 20:23:33,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:33,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 20:23:33,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 20:23:33,457 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 20:23:33,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 20:23:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:33,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 20:23:33,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-18 20:23:33,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:33,580 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 52 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-18 20:23:33,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361780906] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:33,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 20:23:33,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2023-02-18 20:23:33,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469309427] [2023-02-18 20:23:33,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:33,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 20:23:33,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 20:23:33,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 20:23:33,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-18 20:23:33,582 INFO L87 Difference]: Start difference. First operand 4718 states and 6787 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:33,736 INFO L93 Difference]: Finished difference Result 3827 states and 5204 transitions. [2023-02-18 20:23:33,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-18 20:23:33,737 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2023-02-18 20:23:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:33,742 INFO L225 Difference]: With dead ends: 3827 [2023-02-18 20:23:33,742 INFO L226 Difference]: Without dead ends: 3827 [2023-02-18 20:23:33,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2023-02-18 20:23:33,743 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 794 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:33,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1651 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 20:23:33,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2023-02-18 20:23:33,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 2865. [2023-02-18 20:23:33,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 2854 states have (on average 1.3587946741415557) internal successors, (3878), 2864 states have internal predecessors, (3878), 0 states have call successors, (0), 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-18 20:23:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 3878 transitions. [2023-02-18 20:23:33,777 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 3878 transitions. Word has length 63 [2023-02-18 20:23:33,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:33,777 INFO L495 AbstractCegarLoop]: Abstraction has 2865 states and 3878 transitions. [2023-02-18 20:23:33,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 3878 transitions. [2023-02-18 20:23:33,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-18 20:23:33,778 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:33,778 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:33,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-18 20:23:33,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 20:23:33,995 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:33,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:33,995 INFO L85 PathProgramCache]: Analyzing trace with hash 965172541, now seen corresponding path program 1 times [2023-02-18 20:23:33,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 20:23:33,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366667165] [2023-02-18 20:23:33,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:33,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 20:23:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 20:23:34,010 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 20:23:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 20:23:34,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 20:23:34,037 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 20:23:34,038 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2023-02-18 20:23:34,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2023-02-18 20:23:34,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2023-02-18 20:23:34,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2023-02-18 20:23:34,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2023-02-18 20:23:34,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2023-02-18 20:23:34,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2023-02-18 20:23:34,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2023-02-18 20:23:34,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2023-02-18 20:23:34,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2023-02-18 20:23:34,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2023-02-18 20:23:34,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2023-02-18 20:23:34,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2023-02-18 20:23:34,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2023-02-18 20:23:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2023-02-18 20:23:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2023-02-18 20:23:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2023-02-18 20:23:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2023-02-18 20:23:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2023-02-18 20:23:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2023-02-18 20:23:34,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-18 20:23:34,043 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:34,046 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 20:23:34,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 08:23:34 BoogieIcfgContainer [2023-02-18 20:23:34,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 20:23:34,094 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 20:23:34,094 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 20:23:34,094 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 20:23:34,094 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 08:23:26" (3/4) ... [2023-02-18 20:23:34,096 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-18 20:23:34,096 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 20:23:34,097 INFO L158 Benchmark]: Toolchain (without parser) took 8293.63ms. Allocated memory was 163.6MB in the beginning and 268.4MB in the end (delta: 104.9MB). Free memory was 125.4MB in the beginning and 213.6MB in the end (delta: -88.1MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2023-02-18 20:23:34,097 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory was 66.5MB in the beginning and 66.3MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 20:23:34,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.45ms. Allocated memory is still 163.6MB. Free memory was 125.4MB in the beginning and 108.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-18 20:23:34,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.31ms. Allocated memory is still 163.6MB. Free memory was 108.0MB in the beginning and 106.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 20:23:34,098 INFO L158 Benchmark]: Boogie Preprocessor took 36.48ms. Allocated memory is still 163.6MB. Free memory was 106.5MB in the beginning and 104.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 20:23:34,098 INFO L158 Benchmark]: RCFGBuilder took 396.01ms. Allocated memory is still 163.6MB. Free memory was 104.5MB in the beginning and 87.0MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-18 20:23:34,098 INFO L158 Benchmark]: TraceAbstraction took 7551.07ms. Allocated memory was 163.6MB in the beginning and 268.4MB in the end (delta: 104.9MB). Free memory was 87.0MB in the beginning and 213.6MB in the end (delta: -126.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 20:23:34,098 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 268.4MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 20:23:34,099 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.14ms. Allocated memory is still 117.4MB. Free memory was 66.5MB in the beginning and 66.3MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.45ms. Allocated memory is still 163.6MB. Free memory was 125.4MB in the beginning and 108.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.31ms. Allocated memory is still 163.6MB. Free memory was 108.0MB in the beginning and 106.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.48ms. Allocated memory is still 163.6MB. Free memory was 106.5MB in the beginning and 104.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 396.01ms. Allocated memory is still 163.6MB. Free memory was 104.5MB in the beginning and 87.0MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7551.07ms. Allocated memory was 163.6MB in the beginning and 268.4MB in the end (delta: 104.9MB). Free memory was 87.0MB in the beginning and 213.6MB in the end (delta: -126.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 268.4MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L542] x1->data = 4 VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L548] x1->next = t1 VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L594] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6696 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6696 mSDsluCounter, 9583 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7169 mSDsCounter, 280 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2105 IncrementalHoareTripleChecker+Invalid, 2385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 280 mSolverCounterUnsat, 2414 mSDtfsCounter, 2105 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1060 GetRequests, 793 SyntacticMatches, 42 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4918occurred in iteration=18, InterpolantAutomatonStates: 219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 18734 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1236 ConstructedInterpolants, 0 QuantifiedInterpolants, 4032 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1797 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 38 InterpolantComputations, 12 PerfectInterpolantSequences, 1459/1809 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-18 20:23:34,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 20:23:36,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 20:23:36,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 20:23:36,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 20:23:36,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 20:23:36,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 20:23:36,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 20:23:36,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 20:23:36,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 20:23:36,145 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 20:23:36,146 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 20:23:36,147 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 20:23:36,148 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 20:23:36,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 20:23:36,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 20:23:36,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 20:23:36,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 20:23:36,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 20:23:36,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 20:23:36,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 20:23:36,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 20:23:36,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 20:23:36,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 20:23:36,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 20:23:36,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 20:23:36,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 20:23:36,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 20:23:36,169 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 20:23:36,170 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 20:23:36,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 20:23:36,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 20:23:36,173 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 20:23:36,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 20:23:36,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 20:23:36,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 20:23:36,176 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 20:23:36,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 20:23:36,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 20:23:36,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 20:23:36,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 20:23:36,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 20:23:36,178 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-18 20:23:36,209 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 20:23:36,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 20:23:36,211 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 20:23:36,211 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 20:23:36,211 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 20:23:36,212 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 20:23:36,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 20:23:36,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 20:23:36,212 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 20:23:36,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 20:23:36,213 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 20:23:36,213 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 20:23:36,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 20:23:36,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 20:23:36,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 20:23:36,214 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-18 20:23:36,214 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-18 20:23:36,214 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-18 20:23:36,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 20:23:36,214 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 20:23:36,215 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-18 20:23:36,215 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-18 20:23:36,215 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 20:23:36,215 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 20:23:36,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 20:23:36,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 20:23:36,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 20:23:36,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 20:23:36,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 20:23:36,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 20:23:36,216 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-18 20:23:36,216 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-18 20:23:36,216 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 20:23:36,216 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 20:23:36,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 20:23:36,217 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-18 20:23:36,217 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 20:23:36,217 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 -> f3bd5e04188199017a119b2ef3a434e2cfadf1e2e5bbf4182b28eb1a822c186f [2023-02-18 20:23:36,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 20:23:36,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 20:23:36,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 20:23:36,514 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 20:23:36,514 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 20:23:36,515 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.1.i [2023-02-18 20:23:37,655 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 20:23:37,868 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 20:23:37,869 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.1.i [2023-02-18 20:23:37,877 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b79634dfa/f194376127e947fab5eb8d2e75a5b69a/FLAG4cda3cf57 [2023-02-18 20:23:37,890 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b79634dfa/f194376127e947fab5eb8d2e75a5b69a [2023-02-18 20:23:37,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 20:23:37,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 20:23:37,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 20:23:37,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 20:23:37,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 20:23:37,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 08:23:37" (1/1) ... [2023-02-18 20:23:37,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4004a827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:37, skipping insertion in model container [2023-02-18 20:23:37,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 08:23:37" (1/1) ... [2023-02-18 20:23:37,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 20:23:37,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 20:23:38,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 20:23:38,118 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 20:23:38,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 20:23:38,170 INFO L208 MainTranslator]: Completed translation [2023-02-18 20:23:38,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:38 WrapperNode [2023-02-18 20:23:38,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 20:23:38,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 20:23:38,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 20:23:38,173 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 20:23:38,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:38" (1/1) ... [2023-02-18 20:23:38,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:38" (1/1) ... [2023-02-18 20:23:38,203 INFO L138 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2023-02-18 20:23:38,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 20:23:38,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 20:23:38,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 20:23:38,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 20:23:38,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:38" (1/1) ... [2023-02-18 20:23:38,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:38" (1/1) ... [2023-02-18 20:23:38,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:38" (1/1) ... [2023-02-18 20:23:38,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:38" (1/1) ... [2023-02-18 20:23:38,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:38" (1/1) ... [2023-02-18 20:23:38,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:38" (1/1) ... [2023-02-18 20:23:38,223 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:38" (1/1) ... [2023-02-18 20:23:38,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:38" (1/1) ... [2023-02-18 20:23:38,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 20:23:38,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 20:23:38,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 20:23:38,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 20:23:38,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:38" (1/1) ... [2023-02-18 20:23:38,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 20:23:38,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 20:23:38,278 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-18 20:23:38,349 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-18 20:23:38,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-18 20:23:38,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-18 20:23:38,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 20:23:38,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-18 20:23:38,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-18 20:23:38,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-18 20:23:38,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-18 20:23:38,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-18 20:23:38,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 20:23:38,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 20:23:38,516 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 20:23:38,530 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 20:23:38,785 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 20:23:38,794 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 20:23:38,795 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 20:23:38,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 08:23:38 BoogieIcfgContainer [2023-02-18 20:23:38,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 20:23:38,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 20:23:38,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 20:23:38,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 20:23:38,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 08:23:37" (1/3) ... [2023-02-18 20:23:38,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae6d475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 08:23:38, skipping insertion in model container [2023-02-18 20:23:38,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:23:38" (2/3) ... [2023-02-18 20:23:38,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae6d475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 08:23:38, skipping insertion in model container [2023-02-18 20:23:38,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 08:23:38" (3/3) ... [2023-02-18 20:23:38,805 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.i [2023-02-18 20:23:38,817 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 20:23:38,818 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2023-02-18 20:23:38,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 20:23:38,863 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;@5f5b9808, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 20:23:38,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-02-18 20:23:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-18 20:23:38,870 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:38,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-18 20:23:38,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:38,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:38,874 INFO L85 PathProgramCache]: Analyzing trace with hash 28701640, now seen corresponding path program 1 times [2023-02-18 20:23:38,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:38,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587439398] [2023-02-18 20:23:38,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:38,884 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-18 20:23:38,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:38,886 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-18 20:23:38,887 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-18 20:23:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:38,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 20:23:38,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:38,980 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-18 20:23:38,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 20:23:38,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:38,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587439398] [2023-02-18 20:23:38,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587439398] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:38,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:38,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 20:23:38,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895773857] [2023-02-18 20:23:38,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:38,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 20:23:38,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:39,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 20:23:39,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:39,005 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:39,080 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2023-02-18 20:23:39,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 20:23:39,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-18 20:23:39,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:39,089 INFO L225 Difference]: With dead ends: 107 [2023-02-18 20:23:39,089 INFO L226 Difference]: Without dead ends: 105 [2023-02-18 20:23:39,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:39,103 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 63 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:39,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 134 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 20:23:39,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-18 20:23:39,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2023-02-18 20:23:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 86 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2023-02-18 20:23:39,145 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 5 [2023-02-18 20:23:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:39,145 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2023-02-18 20:23:39,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:39,146 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2023-02-18 20:23:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-18 20:23:39,146 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:39,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-18 20:23:39,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-18 20:23:39,351 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-18 20:23:39,352 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:39,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:39,353 INFO L85 PathProgramCache]: Analyzing trace with hash 889749439, now seen corresponding path program 1 times [2023-02-18 20:23:39,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:39,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326814901] [2023-02-18 20:23:39,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:39,353 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-18 20:23:39,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:39,360 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-18 20:23:39,362 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-18 20:23:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:39,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 20:23:39,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:39,446 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-18 20:23:39,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 20:23:39,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:39,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326814901] [2023-02-18 20:23:39,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326814901] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:39,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:39,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 20:23:39,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174187814] [2023-02-18 20:23:39,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:39,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 20:23:39,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:39,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 20:23:39,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:39,449 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-18 20:23:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:39,532 INFO L93 Difference]: Finished difference Result 163 states and 243 transitions. [2023-02-18 20:23:39,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 20:23:39,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-18 20:23:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:39,534 INFO L225 Difference]: With dead ends: 163 [2023-02-18 20:23:39,534 INFO L226 Difference]: Without dead ends: 160 [2023-02-18 20:23:39,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:39,535 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 62 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:39,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 20:23:39,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-18 20:23:39,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2023-02-18 20:23:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 139 states have internal predecessors, (229), 0 states have call successors, (0), 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-18 20:23:39,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 229 transitions. [2023-02-18 20:23:39,548 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 229 transitions. Word has length 6 [2023-02-18 20:23:39,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:39,548 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 229 transitions. [2023-02-18 20:23:39,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-18 20:23:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 229 transitions. [2023-02-18 20:23:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-18 20:23:39,548 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:39,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-18 20:23:39,572 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-18 20:23:39,755 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-18 20:23:39,756 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:39,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:39,756 INFO L85 PathProgramCache]: Analyzing trace with hash 889692424, now seen corresponding path program 1 times [2023-02-18 20:23:39,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:39,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642582422] [2023-02-18 20:23:39,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:39,757 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-18 20:23:39,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:39,759 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-18 20:23:39,761 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-18 20:23:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:39,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 20:23:39,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:39,888 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-18 20:23:39,890 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-18 20:23:39,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 20:23:39,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:39,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642582422] [2023-02-18 20:23:39,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642582422] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:39,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:39,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 20:23:39,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082969954] [2023-02-18 20:23:39,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:39,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 20:23:39,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:39,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 20:23:39,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:39,896 INFO L87 Difference]: Start difference. First operand 140 states and 229 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-18 20:23:39,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:39,994 INFO L93 Difference]: Finished difference Result 211 states and 330 transitions. [2023-02-18 20:23:39,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 20:23:39,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-18 20:23:39,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:39,995 INFO L225 Difference]: With dead ends: 211 [2023-02-18 20:23:39,995 INFO L226 Difference]: Without dead ends: 211 [2023-02-18 20:23:39,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:39,996 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 64 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:39,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 163 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 20:23:39,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-18 20:23:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 190. [2023-02-18 20:23:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 172 states have (on average 1.8372093023255813) internal successors, (316), 189 states have internal predecessors, (316), 0 states have call successors, (0), 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-18 20:23:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 316 transitions. [2023-02-18 20:23:40,007 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 316 transitions. Word has length 6 [2023-02-18 20:23:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:40,007 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 316 transitions. [2023-02-18 20:23:40,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-18 20:23:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 316 transitions. [2023-02-18 20:23:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-18 20:23:40,007 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:40,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-18 20:23:40,017 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-18 20:23:40,215 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-18 20:23:40,215 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:40,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:40,216 INFO L85 PathProgramCache]: Analyzing trace with hash 889692425, now seen corresponding path program 1 times [2023-02-18 20:23:40,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:40,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846658934] [2023-02-18 20:23:40,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:40,216 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-18 20:23:40,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:40,217 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-18 20:23:40,220 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-18 20:23:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:40,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 20:23:40,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:40,259 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-18 20:23:40,261 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-18 20:23:40,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 20:23:40,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:40,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846658934] [2023-02-18 20:23:40,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846658934] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:40,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:40,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 20:23:40,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922701036] [2023-02-18 20:23:40,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:40,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 20:23:40,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:40,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 20:23:40,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:40,263 INFO L87 Difference]: Start difference. First operand 190 states and 316 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-18 20:23:40,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:40,351 INFO L93 Difference]: Finished difference Result 206 states and 321 transitions. [2023-02-18 20:23:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 20:23:40,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-18 20:23:40,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:40,352 INFO L225 Difference]: With dead ends: 206 [2023-02-18 20:23:40,352 INFO L226 Difference]: Without dead ends: 206 [2023-02-18 20:23:40,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 20:23:40,354 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 63 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:40,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 169 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 20:23:40,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-02-18 20:23:40,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 188. [2023-02-18 20:23:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 172 states have (on average 1.7906976744186047) internal successors, (308), 187 states have internal predecessors, (308), 0 states have call successors, (0), 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-18 20:23:40,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 308 transitions. [2023-02-18 20:23:40,373 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 308 transitions. Word has length 6 [2023-02-18 20:23:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:40,373 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 308 transitions. [2023-02-18 20:23:40,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-18 20:23:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 308 transitions. [2023-02-18 20:23:40,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-18 20:23:40,374 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:40,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:40,393 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-18 20:23:40,581 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-18 20:23:40,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:40,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:40,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1810669365, now seen corresponding path program 1 times [2023-02-18 20:23:40,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:40,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725248748] [2023-02-18 20:23:40,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:40,583 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-18 20:23:40,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:40,586 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-18 20:23:40,590 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-18 20:23:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:40,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 20:23:40,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:40,657 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-18 20:23:40,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 20:23:40,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:40,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725248748] [2023-02-18 20:23:40,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725248748] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:40,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:40,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 20:23:40,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339193658] [2023-02-18 20:23:40,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:40,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 20:23:40,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:40,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 20:23:40,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 20:23:40,658 INFO L87 Difference]: Start difference. First operand 188 states and 308 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-18 20:23:40,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:40,704 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2023-02-18 20:23:40,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 20:23:40,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-18 20:23:40,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:40,705 INFO L225 Difference]: With dead ends: 211 [2023-02-18 20:23:40,705 INFO L226 Difference]: Without dead ends: 211 [2023-02-18 20:23:40,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-18 20:23:40,707 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 101 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:40,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 229 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:40,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-18 20:23:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 144. [2023-02-18 20:23:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 143 states have internal predecessors, (229), 0 states have call successors, (0), 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-18 20:23:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 229 transitions. [2023-02-18 20:23:40,719 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 229 transitions. Word has length 7 [2023-02-18 20:23:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:40,719 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 229 transitions. [2023-02-18 20:23:40,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-18 20:23:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 229 transitions. [2023-02-18 20:23:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 20:23:40,720 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:40,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:40,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-02-18 20:23:40,926 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-18 20:23:40,926 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:40,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:40,927 INFO L85 PathProgramCache]: Analyzing trace with hash 347531241, now seen corresponding path program 1 times [2023-02-18 20:23:40,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:40,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241752606] [2023-02-18 20:23:40,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:40,928 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-18 20:23:40,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:40,930 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-18 20:23:40,930 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-18 20:23:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:40,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 20:23:40,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:41,006 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-18 20:23:41,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 20:23:41,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:41,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241752606] [2023-02-18 20:23:41,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241752606] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 20:23:41,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 20:23:41,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 20:23:41,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821386573] [2023-02-18 20:23:41,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 20:23:41,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 20:23:41,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:41,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 20:23:41,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 20:23:41,013 INFO L87 Difference]: Start difference. First operand 144 states and 229 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:41,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:41,043 INFO L93 Difference]: Finished difference Result 283 states and 430 transitions. [2023-02-18 20:23:41,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 20:23:41,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-18 20:23:41,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:41,045 INFO L225 Difference]: With dead ends: 283 [2023-02-18 20:23:41,045 INFO L226 Difference]: Without dead ends: 283 [2023-02-18 20:23:41,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-18 20:23:41,047 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 103 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:41,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 196 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:41,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-02-18 20:23:41,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 198. [2023-02-18 20:23:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 186 states have (on average 1.6559139784946237) internal successors, (308), 197 states have internal predecessors, (308), 0 states have call successors, (0), 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-18 20:23:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 308 transitions. [2023-02-18 20:23:41,060 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 308 transitions. Word has length 8 [2023-02-18 20:23:41,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:41,060 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 308 transitions. [2023-02-18 20:23:41,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:41,060 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 308 transitions. [2023-02-18 20:23:41,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 20:23:41,061 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:41,061 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:41,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-02-18 20:23:41,269 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-18 20:23:41,270 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:41,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:41,271 INFO L85 PathProgramCache]: Analyzing trace with hash -527615340, now seen corresponding path program 1 times [2023-02-18 20:23:41,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:41,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700301820] [2023-02-18 20:23:41,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:41,271 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-18 20:23:41,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:41,272 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-18 20:23:41,274 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-18 20:23:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:41,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 20:23:41,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:41,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:41,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:41,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700301820] [2023-02-18 20:23:41,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700301820] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:41,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 20:23:41,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-02-18 20:23:41,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891532604] [2023-02-18 20:23:41,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:41,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 20:23:41,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:41,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 20:23:41,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 20:23:41,368 INFO L87 Difference]: Start difference. First operand 198 states and 308 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:41,439 INFO L93 Difference]: Finished difference Result 461 states and 690 transitions. [2023-02-18 20:23:41,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 20:23:41,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-18 20:23:41,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:41,442 INFO L225 Difference]: With dead ends: 461 [2023-02-18 20:23:41,442 INFO L226 Difference]: Without dead ends: 461 [2023-02-18 20:23:41,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-02-18 20:23:41,445 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 221 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:41,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 471 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:41,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2023-02-18 20:23:41,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 258. [2023-02-18 20:23:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 246 states have (on average 1.6016260162601625) internal successors, (394), 257 states have internal predecessors, (394), 0 states have call successors, (0), 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-18 20:23:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 394 transitions. [2023-02-18 20:23:41,451 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 394 transitions. Word has length 12 [2023-02-18 20:23:41,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:41,452 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 394 transitions. [2023-02-18 20:23:41,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 394 transitions. [2023-02-18 20:23:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 20:23:41,453 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:41,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:41,473 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-18 20:23:41,660 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-18 20:23:41,660 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2027186576, now seen corresponding path program 1 times [2023-02-18 20:23:41,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:41,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658756927] [2023-02-18 20:23:41,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:41,661 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-18 20:23:41,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:41,662 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-18 20:23:41,665 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-18 20:23:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:41,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 20:23:41,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:41,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:41,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:41,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658756927] [2023-02-18 20:23:41,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658756927] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:41,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 20:23:41,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-02-18 20:23:41,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135420296] [2023-02-18 20:23:41,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:41,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 20:23:41,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:41,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 20:23:41,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-18 20:23:41,727 INFO L87 Difference]: Start difference. First operand 258 states and 394 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:41,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:41,757 INFO L93 Difference]: Finished difference Result 600 states and 886 transitions. [2023-02-18 20:23:41,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 20:23:41,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-18 20:23:41,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:41,759 INFO L225 Difference]: With dead ends: 600 [2023-02-18 20:23:41,759 INFO L226 Difference]: Without dead ends: 600 [2023-02-18 20:23:41,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 20:23:41,760 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 210 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:41,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 343 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:41,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2023-02-18 20:23:41,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 576. [2023-02-18 20:23:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 564 states have (on average 1.570921985815603) internal successors, (886), 575 states have internal predecessors, (886), 0 states have call successors, (0), 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-18 20:23:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 886 transitions. [2023-02-18 20:23:41,769 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 886 transitions. Word has length 12 [2023-02-18 20:23:41,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:41,769 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 886 transitions. [2023-02-18 20:23:41,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 886 transitions. [2023-02-18 20:23:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 20:23:41,770 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:41,770 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:41,777 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-18 20:23:41,977 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-18 20:23:41,978 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:41,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:41,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1582579647, now seen corresponding path program 2 times [2023-02-18 20:23:41,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:41,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065341031] [2023-02-18 20:23:41,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 20:23:41,979 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-18 20:23:41,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:41,983 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 20:23:41,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-18 20:23:42,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 20:23:42,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 20:23:42,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 20:23:42,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 20:23:42,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:42,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 20:23:42,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:42,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065341031] [2023-02-18 20:23:42,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065341031] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:42,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 20:23:42,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-02-18 20:23:42,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325918152] [2023-02-18 20:23:42,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:42,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 20:23:42,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:42,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 20:23:42,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-18 20:23:42,062 INFO L87 Difference]: Start difference. First operand 576 states and 886 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:42,161 INFO L93 Difference]: Finished difference Result 1048 states and 1542 transitions. [2023-02-18 20:23:42,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 20:23:42,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-18 20:23:42,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:42,164 INFO L225 Difference]: With dead ends: 1048 [2023-02-18 20:23:42,164 INFO L226 Difference]: Without dead ends: 1048 [2023-02-18 20:23:42,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-18 20:23:42,165 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 233 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:42,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 621 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 20:23:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2023-02-18 20:23:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 760. [2023-02-18 20:23:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 748 states have (on average 1.5026737967914439) internal successors, (1124), 759 states have internal predecessors, (1124), 0 states have call successors, (0), 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-18 20:23:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1124 transitions. [2023-02-18 20:23:42,177 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1124 transitions. Word has length 16 [2023-02-18 20:23:42,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:42,177 INFO L495 AbstractCegarLoop]: Abstraction has 760 states and 1124 transitions. [2023-02-18 20:23:42,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:42,177 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1124 transitions. [2023-02-18 20:23:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 20:23:42,178 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:42,178 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:42,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-18 20:23:42,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 20:23:42,385 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:42,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:42,386 INFO L85 PathProgramCache]: Analyzing trace with hash -480845608, now seen corresponding path program 1 times [2023-02-18 20:23:42,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:42,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436978185] [2023-02-18 20:23:42,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:42,386 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-18 20:23:42,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:42,387 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 20:23:42,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-18 20:23:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:42,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 20:23:42,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:42,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:42,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:42,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436978185] [2023-02-18 20:23:42,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436978185] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:42,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 20:23:42,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2023-02-18 20:23:42,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904595502] [2023-02-18 20:23:42,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:42,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 20:23:42,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:42,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 20:23:42,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 20:23:42,441 INFO L87 Difference]: Start difference. First operand 760 states and 1124 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:42,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:42,482 INFO L93 Difference]: Finished difference Result 1055 states and 1524 transitions. [2023-02-18 20:23:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 20:23:42,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-18 20:23:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:42,485 INFO L225 Difference]: With dead ends: 1055 [2023-02-18 20:23:42,485 INFO L226 Difference]: Without dead ends: 1055 [2023-02-18 20:23:42,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-18 20:23:42,486 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 89 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:42,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 192 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2023-02-18 20:23:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 912. [2023-02-18 20:23:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 900 states have (on average 1.471111111111111) internal successors, (1324), 911 states have internal predecessors, (1324), 0 states have call successors, (0), 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-18 20:23:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1324 transitions. [2023-02-18 20:23:42,507 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1324 transitions. Word has length 18 [2023-02-18 20:23:42,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:42,507 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 1324 transitions. [2023-02-18 20:23:42,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1324 transitions. [2023-02-18 20:23:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 20:23:42,508 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:42,508 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:42,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-18 20:23:42,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 20:23:42,715 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:42,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:42,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1323238580, now seen corresponding path program 1 times [2023-02-18 20:23:42,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:42,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104843896] [2023-02-18 20:23:42,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:42,716 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-18 20:23:42,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:42,717 INFO L229 MonitoredProcess]: Starting monitored process 12 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-18 20:23:42,720 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 (12)] Waiting until timeout for monitored process [2023-02-18 20:23:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:42,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 20:23:42,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:42,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:42,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:42,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104843896] [2023-02-18 20:23:42,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104843896] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:42,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 20:23:42,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-02-18 20:23:42,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949167143] [2023-02-18 20:23:42,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:42,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 20:23:42,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:42,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 20:23:42,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 20:23:42,835 INFO L87 Difference]: Start difference. First operand 912 states and 1324 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:42,889 INFO L93 Difference]: Finished difference Result 1144 states and 1576 transitions. [2023-02-18 20:23:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 20:23:42,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-18 20:23:42,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:42,892 INFO L225 Difference]: With dead ends: 1144 [2023-02-18 20:23:42,893 INFO L226 Difference]: Without dead ends: 1144 [2023-02-18 20:23:42,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-18 20:23:42,893 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 201 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:42,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 539 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:42,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2023-02-18 20:23:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 835. [2023-02-18 20:23:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 823 states have (on average 1.4349939246658565) internal successors, (1181), 834 states have internal predecessors, (1181), 0 states have call successors, (0), 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-18 20:23:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1181 transitions. [2023-02-18 20:23:42,906 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1181 transitions. Word has length 21 [2023-02-18 20:23:42,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:42,906 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 1181 transitions. [2023-02-18 20:23:42,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:42,906 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1181 transitions. [2023-02-18 20:23:42,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-18 20:23:42,909 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:42,909 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:42,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-02-18 20:23:43,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-18 20:23:43,119 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:43,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:43,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2034622781, now seen corresponding path program 2 times [2023-02-18 20:23:43,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:43,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498276747] [2023-02-18 20:23:43,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 20:23:43,120 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-18 20:23:43,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:43,121 INFO L229 MonitoredProcess]: Starting monitored process 13 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-18 20:23:43,121 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 (13)] Waiting until timeout for monitored process [2023-02-18 20:23:43,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 20:23:43,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 20:23:43,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 20:23:43,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 20:23:43,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 20:23:43,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:43,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498276747] [2023-02-18 20:23:43,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498276747] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:43,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 20:23:43,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-18 20:23:43,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979062809] [2023-02-18 20:23:43,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:43,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 20:23:43,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:43,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 20:23:43,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-18 20:23:43,205 INFO L87 Difference]: Start difference. First operand 835 states and 1181 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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-18 20:23:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:43,258 INFO L93 Difference]: Finished difference Result 826 states and 1126 transitions. [2023-02-18 20:23:43,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 20:23:43,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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 27 [2023-02-18 20:23:43,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:43,261 INFO L225 Difference]: With dead ends: 826 [2023-02-18 20:23:43,261 INFO L226 Difference]: Without dead ends: 826 [2023-02-18 20:23:43,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-18 20:23:43,261 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 216 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:43,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 488 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:43,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2023-02-18 20:23:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 802. [2023-02-18 20:23:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 790 states have (on average 1.4253164556962026) internal successors, (1126), 801 states have internal predecessors, (1126), 0 states have call successors, (0), 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-18 20:23:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1126 transitions. [2023-02-18 20:23:43,272 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1126 transitions. Word has length 27 [2023-02-18 20:23:43,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:43,272 INFO L495 AbstractCegarLoop]: Abstraction has 802 states and 1126 transitions. [2023-02-18 20:23:43,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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-18 20:23:43,273 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1126 transitions. [2023-02-18 20:23:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-18 20:23:43,273 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:43,273 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:43,295 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 (13)] Forceful destruction successful, exit code 0 [2023-02-18 20:23:43,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-18 20:23:43,481 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:43,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:43,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1432941687, now seen corresponding path program 1 times [2023-02-18 20:23:43,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:43,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498209165] [2023-02-18 20:23:43,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:43,482 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-18 20:23:43,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:43,488 INFO L229 MonitoredProcess]: Starting monitored process 14 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-18 20:23:43,490 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 (14)] Waiting until timeout for monitored process [2023-02-18 20:23:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:43,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 20:23:43,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:43,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:43,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:43,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498209165] [2023-02-18 20:23:43,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498209165] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:43,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 20:23:43,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-02-18 20:23:43,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415943320] [2023-02-18 20:23:43,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:43,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 20:23:43,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:43,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 20:23:43,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 20:23:43,578 INFO L87 Difference]: Start difference. First operand 802 states and 1126 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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-18 20:23:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:43,643 INFO L93 Difference]: Finished difference Result 871 states and 1150 transitions. [2023-02-18 20:23:43,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 20:23:43,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2023-02-18 20:23:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:43,646 INFO L225 Difference]: With dead ends: 871 [2023-02-18 20:23:43,646 INFO L226 Difference]: Without dead ends: 871 [2023-02-18 20:23:43,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-18 20:23:43,646 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 233 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:43,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 808 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 20:23:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2023-02-18 20:23:43,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 736. [2023-02-18 20:23:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 724 states have (on average 1.388121546961326) internal successors, (1005), 735 states have internal predecessors, (1005), 0 states have call successors, (0), 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-18 20:23:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1005 transitions. [2023-02-18 20:23:43,656 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1005 transitions. Word has length 27 [2023-02-18 20:23:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:43,656 INFO L495 AbstractCegarLoop]: Abstraction has 736 states and 1005 transitions. [2023-02-18 20:23:43,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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-18 20:23:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1005 transitions. [2023-02-18 20:23:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 20:23:43,657 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:43,657 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:43,679 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 (14)] Forceful destruction successful, exit code 0 [2023-02-18 20:23:43,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-18 20:23:43,865 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1945741357, now seen corresponding path program 1 times [2023-02-18 20:23:43,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:43,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458207801] [2023-02-18 20:23:43,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:43,866 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-18 20:23:43,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:43,867 INFO L229 MonitoredProcess]: Starting monitored process 15 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-18 20:23:43,869 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 (15)] Waiting until timeout for monitored process [2023-02-18 20:23:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:43,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 20:23:43,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:43,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:44,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:44,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458207801] [2023-02-18 20:23:44,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458207801] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:44,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 20:23:44,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2023-02-18 20:23:44,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947977141] [2023-02-18 20:23:44,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:44,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 20:23:44,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:44,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 20:23:44,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-02-18 20:23:44,031 INFO L87 Difference]: Start difference. First operand 736 states and 1005 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:44,267 INFO L93 Difference]: Finished difference Result 1562 states and 2099 transitions. [2023-02-18 20:23:44,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-18 20:23:44,268 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-18 20:23:44,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:44,271 INFO L225 Difference]: With dead ends: 1562 [2023-02-18 20:23:44,271 INFO L226 Difference]: Without dead ends: 1562 [2023-02-18 20:23:44,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2023-02-18 20:23:44,272 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 670 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:44,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1291 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 20:23:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2023-02-18 20:23:44,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1514. [2023-02-18 20:23:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1502 states have (on average 1.3974700399467377) internal successors, (2099), 1513 states have internal predecessors, (2099), 0 states have call successors, (0), 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-18 20:23:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2099 transitions. [2023-02-18 20:23:44,292 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2099 transitions. Word has length 30 [2023-02-18 20:23:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:44,292 INFO L495 AbstractCegarLoop]: Abstraction has 1514 states and 2099 transitions. [2023-02-18 20:23:44,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2099 transitions. [2023-02-18 20:23:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 20:23:44,293 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:44,293 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:44,301 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 (15)] Forceful destruction successful, exit code 0 [2023-02-18 20:23:44,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-18 20:23:44,500 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:44,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:44,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1575281728, now seen corresponding path program 1 times [2023-02-18 20:23:44,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:44,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674944033] [2023-02-18 20:23:44,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:44,501 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-18 20:23:44,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:44,502 INFO L229 MonitoredProcess]: Starting monitored process 16 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-18 20:23:44,504 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 (16)] Waiting until timeout for monitored process [2023-02-18 20:23:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:44,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 20:23:44,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:44,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:44,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:44,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674944033] [2023-02-18 20:23:44,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674944033] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:44,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 20:23:44,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2023-02-18 20:23:44,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262360469] [2023-02-18 20:23:44,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:44,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 20:23:44,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:44,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 20:23:44,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-18 20:23:44,614 INFO L87 Difference]: Start difference. First operand 1514 states and 2099 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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-18 20:23:44,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:44,699 INFO L93 Difference]: Finished difference Result 1881 states and 2531 transitions. [2023-02-18 20:23:44,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 20:23:44,699 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-02-18 20:23:44,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:44,704 INFO L225 Difference]: With dead ends: 1881 [2023-02-18 20:23:44,704 INFO L226 Difference]: Without dead ends: 1881 [2023-02-18 20:23:44,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-18 20:23:44,705 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 274 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:44,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1139 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 20:23:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2023-02-18 20:23:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1470. [2023-02-18 20:23:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1458 states have (on average 1.379286694101509) internal successors, (2011), 1469 states have internal predecessors, (2011), 0 states have call successors, (0), 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-18 20:23:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 2011 transitions. [2023-02-18 20:23:44,723 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 2011 transitions. Word has length 33 [2023-02-18 20:23:44,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:44,723 INFO L495 AbstractCegarLoop]: Abstraction has 1470 states and 2011 transitions. [2023-02-18 20:23:44,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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-18 20:23:44,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 2011 transitions. [2023-02-18 20:23:44,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-18 20:23:44,724 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:44,724 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:44,733 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 (16)] Forceful destruction successful, exit code 0 [2023-02-18 20:23:44,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-18 20:23:44,931 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:44,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:44,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1822753242, now seen corresponding path program 1 times [2023-02-18 20:23:44,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:44,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883051918] [2023-02-18 20:23:44,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:44,932 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-18 20:23:44,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:44,933 INFO L229 MonitoredProcess]: Starting monitored process 17 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-18 20:23:44,947 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 (17)] Waiting until timeout for monitored process [2023-02-18 20:23:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 20:23:45,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 20:23:45,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:45,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:45,072 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 20:23:45,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:45,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883051918] [2023-02-18 20:23:45,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883051918] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:45,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 20:23:45,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-18 20:23:45,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009528752] [2023-02-18 20:23:45,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:45,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 20:23:45,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:45,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 20:23:45,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-18 20:23:45,074 INFO L87 Difference]: Start difference. First operand 1470 states and 2011 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 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-18 20:23:45,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:45,200 INFO L93 Difference]: Finished difference Result 1871 states and 2487 transitions. [2023-02-18 20:23:45,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 20:23:45,201 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 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) Word has length 41 [2023-02-18 20:23:45,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:45,205 INFO L225 Difference]: With dead ends: 1871 [2023-02-18 20:23:45,205 INFO L226 Difference]: Without dead ends: 1871 [2023-02-18 20:23:45,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-02-18 20:23:45,206 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 340 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:45,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1561 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 20:23:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2023-02-18 20:23:45,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1448. [2023-02-18 20:23:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1436 states have (on average 1.3697771587743732) internal successors, (1967), 1447 states have internal predecessors, (1967), 0 states have call successors, (0), 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-18 20:23:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1967 transitions. [2023-02-18 20:23:45,223 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1967 transitions. Word has length 41 [2023-02-18 20:23:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:45,223 INFO L495 AbstractCegarLoop]: Abstraction has 1448 states and 1967 transitions. [2023-02-18 20:23:45,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 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-18 20:23:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1967 transitions. [2023-02-18 20:23:45,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-18 20:23:45,224 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:45,224 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:45,247 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 (17)] Forceful destruction successful, exit code 0 [2023-02-18 20:23:45,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-18 20:23:45,432 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:45,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:45,432 INFO L85 PathProgramCache]: Analyzing trace with hash 685518324, now seen corresponding path program 2 times [2023-02-18 20:23:45,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:45,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038140841] [2023-02-18 20:23:45,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 20:23:45,433 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-18 20:23:45,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:45,434 INFO L229 MonitoredProcess]: Starting monitored process 18 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-18 20:23:45,436 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 (18)] Waiting until timeout for monitored process [2023-02-18 20:23:45,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 20:23:45,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 20:23:45,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 20:23:45,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 20:23:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 20:23:45,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 20:23:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 20:23:45,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 20:23:45,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038140841] [2023-02-18 20:23:45,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038140841] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 20:23:45,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 20:23:45,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2023-02-18 20:23:45,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236593796] [2023-02-18 20:23:45,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 20:23:45,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 20:23:45,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 20:23:45,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 20:23:45,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-18 20:23:45,702 INFO L87 Difference]: Start difference. First operand 1448 states and 1967 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:46,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 20:23:46,034 INFO L93 Difference]: Finished difference Result 1662 states and 2170 transitions. [2023-02-18 20:23:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-18 20:23:46,034 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-02-18 20:23:46,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 20:23:46,038 INFO L225 Difference]: With dead ends: 1662 [2023-02-18 20:23:46,038 INFO L226 Difference]: Without dead ends: 1662 [2023-02-18 20:23:46,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2023-02-18 20:23:46,039 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 763 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 20:23:46,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 2047 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 20:23:46,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2023-02-18 20:23:46,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1602. [2023-02-18 20:23:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1590 states have (on average 1.3647798742138364) internal successors, (2170), 1601 states have internal predecessors, (2170), 0 states have call successors, (0), 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-18 20:23:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2170 transitions. [2023-02-18 20:23:46,057 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2170 transitions. Word has length 49 [2023-02-18 20:23:46,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 20:23:46,057 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 2170 transitions. [2023-02-18 20:23:46,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 20:23:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2170 transitions. [2023-02-18 20:23:46,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-18 20:23:46,058 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 20:23:46,067 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:46,089 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 (18)] Forceful destruction successful, exit code 0 [2023-02-18 20:23:46,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-18 20:23:46,275 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-02-18 20:23:46,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 20:23:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash 34201258, now seen corresponding path program 1 times [2023-02-18 20:23:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 20:23:46,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071854401] [2023-02-18 20:23:46,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 20:23:46,276 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-18 20:23:46,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 20:23:46,277 INFO L229 MonitoredProcess]: Starting monitored process 19 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-18 20:23:46,280 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 (19)] Waiting until timeout for monitored process [2023-02-18 20:23:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 20:23:46,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 20:23:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 20:23:46,423 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-18 20:23:46,424 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 20:23:46,424 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2023-02-18 20:23:46,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2023-02-18 20:23:46,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2023-02-18 20:23:46,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2023-02-18 20:23:46,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2023-02-18 20:23:46,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2023-02-18 20:23:46,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2023-02-18 20:23:46,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2023-02-18 20:23:46,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2023-02-18 20:23:46,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2023-02-18 20:23:46,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2023-02-18 20:23:46,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2023-02-18 20:23:46,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2023-02-18 20:23:46,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2023-02-18 20:23:46,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2023-02-18 20:23:46,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2023-02-18 20:23:46,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2023-02-18 20:23:46,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2023-02-18 20:23:46,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2023-02-18 20:23:46,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2023-02-18 20:23:46,438 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 (19)] Forceful destruction successful, exit code 0 [2023-02-18 20:23:46,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-18 20:23:46,639 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 20:23:46,641 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 20:23:46,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 08:23:46 BoogieIcfgContainer [2023-02-18 20:23:46,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 20:23:46,694 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 20:23:46,694 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 20:23:46,694 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 20:23:46,694 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 08:23:38" (3/4) ... [2023-02-18 20:23:46,696 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-18 20:23:46,696 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 20:23:46,697 INFO L158 Benchmark]: Toolchain (without parser) took 8804.22ms. Allocated memory was 65.0MB in the beginning and 123.7MB in the end (delta: 58.7MB). Free memory was 40.6MB in the beginning and 78.0MB in the end (delta: -37.4MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2023-02-18 20:23:46,697 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 52.4MB. Free memory was 29.9MB in the beginning and 29.9MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 20:23:46,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.51ms. Allocated memory is still 65.0MB. Free memory was 40.3MB in the beginning and 37.7MB in the end (delta: 2.6MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2023-02-18 20:23:46,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.52ms. Allocated memory is still 65.0MB. Free memory was 37.5MB in the beginning and 35.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 20:23:46,698 INFO L158 Benchmark]: Boogie Preprocessor took 22.25ms. Allocated memory is still 65.0MB. Free memory was 35.5MB in the beginning and 33.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 20:23:46,699 INFO L158 Benchmark]: RCFGBuilder took 570.05ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 33.4MB in the beginning and 45.5MB in the end (delta: -12.0MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2023-02-18 20:23:46,700 INFO L158 Benchmark]: TraceAbstraction took 7894.72ms. Allocated memory was 79.7MB in the beginning and 123.7MB in the end (delta: 44.0MB). Free memory was 44.8MB in the beginning and 78.0MB in the end (delta: -33.2MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2023-02-18 20:23:46,700 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 123.7MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 20:23:46,702 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.14ms. Allocated memory is still 52.4MB. Free memory was 29.9MB in the beginning and 29.9MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.51ms. Allocated memory is still 65.0MB. Free memory was 40.3MB in the beginning and 37.7MB in the end (delta: 2.6MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.52ms. Allocated memory is still 65.0MB. Free memory was 37.5MB in the beginning and 35.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.25ms. Allocated memory is still 65.0MB. Free memory was 35.5MB in the beginning and 33.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 570.05ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 33.4MB in the beginning and 45.5MB in the end (delta: -12.0MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7894.72ms. Allocated memory was 79.7MB in the beginning and 123.7MB in the end (delta: 44.0MB). Free memory was 44.8MB in the beginning and 78.0MB in the end (delta: -33.2MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 123.7MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L542] x1->data = 4 VAL [garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L548] x1->next = t1 VAL [garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={6:0}, t1={0:0}, t4={0:0}, x1={6:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3906 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3906 mSDsluCounter, 10507 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8086 mSDsCounter, 280 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1237 IncrementalHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 280 mSolverCounterUnsat, 2421 mSDtfsCounter, 1237 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 650 GetRequests, 487 SyntacticMatches, 19 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1602occurred in iteration=17, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 2297 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 582 ConstructedInterpolants, 0 QuantifiedInterpolants, 4625 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1510 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 204/538 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-18 20:23:46,723 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