./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/simple_built_from_end.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3dbbec33 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/simple_built_from_end.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 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 13:48:30,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 13:48:30,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 13:48:30,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 13:48:30,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 13:48:30,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 13:48:30,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 13:48:30,564 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 13:48:30,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 13:48:30,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 13:48:30,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 13:48:30,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 13:48:30,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 13:48:30,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 13:48:30,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 13:48:30,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 13:48:30,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 13:48:30,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 13:48:30,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 13:48:30,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 13:48:30,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 13:48:30,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 13:48:30,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 13:48:30,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 13:48:30,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 13:48:30,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 13:48:30,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 13:48:30,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 13:48:30,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 13:48:30,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 13:48:30,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 13:48:30,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 13:48:30,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 13:48:30,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 13:48:30,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 13:48:30,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 13:48:30,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 13:48:30,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 13:48:30,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 13:48:30,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 13:48:30,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 13:48:30,595 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 13:48:30,611 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 13:48:30,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 13:48:30,611 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 13:48:30,611 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 13:48:30,612 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 13:48:30,612 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 13:48:30,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 13:48:30,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 13:48:30,613 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 13:48:30,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 13:48:30,613 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 13:48:30,613 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 13:48:30,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 13:48:30,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 13:48:30,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 13:48:30,614 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 13:48:30,614 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 13:48:30,614 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 13:48:30,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 13:48:30,614 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 13:48:30,614 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 13:48:30,615 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 13:48:30,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 13:48:30,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 13:48:30,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 13:48:30,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:48:30,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 13:48:30,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 13:48:30,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 13:48:30,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 13:48:30,616 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 13:48:30,616 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 13:48:30,616 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 13:48:30,616 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 13:48:30,616 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 -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2023-02-14 13:48:30,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 13:48:30,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 13:48:30,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 13:48:30,810 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 13:48:30,810 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 13:48:30,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple_built_from_end.i [2023-02-14 13:48:31,721 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 13:48:31,897 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 13:48:31,897 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i [2023-02-14 13:48:31,904 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a20e75df/200e080abf2e42f3816716bc3dd79d60/FLAGe8ec2be8e [2023-02-14 13:48:31,913 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a20e75df/200e080abf2e42f3816716bc3dd79d60 [2023-02-14 13:48:31,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 13:48:31,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 13:48:31,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 13:48:31,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 13:48:31,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 13:48:31,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:48:31" (1/1) ... [2023-02-14 13:48:31,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39fdf9e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:31, skipping insertion in model container [2023-02-14 13:48:31,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:48:31" (1/1) ... [2023-02-14 13:48:31,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 13:48:31,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 13:48:32,099 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2023-02-14 13:48:32,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:48:32,108 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 13:48:32,128 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2023-02-14 13:48:32,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:48:32,146 INFO L208 MainTranslator]: Completed translation [2023-02-14 13:48:32,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:32 WrapperNode [2023-02-14 13:48:32,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 13:48:32,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 13:48:32,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 13:48:32,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 13:48:32,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:32" (1/1) ... [2023-02-14 13:48:32,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:32" (1/1) ... [2023-02-14 13:48:32,178 INFO L138 Inliner]: procedures = 124, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2023-02-14 13:48:32,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 13:48:32,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 13:48:32,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 13:48:32,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 13:48:32,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:32" (1/1) ... [2023-02-14 13:48:32,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:32" (1/1) ... [2023-02-14 13:48:32,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:32" (1/1) ... [2023-02-14 13:48:32,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:32" (1/1) ... [2023-02-14 13:48:32,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:32" (1/1) ... [2023-02-14 13:48:32,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:32" (1/1) ... [2023-02-14 13:48:32,210 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:32" (1/1) ... [2023-02-14 13:48:32,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:32" (1/1) ... [2023-02-14 13:48:32,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 13:48:32,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 13:48:32,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 13:48:32,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 13:48:32,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:32" (1/1) ... [2023-02-14 13:48:32,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:48:32,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:48:32,240 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-14 13:48:32,259 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-14 13:48:32,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 13:48:32,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 13:48:32,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 13:48:32,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 13:48:32,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 13:48:32,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 13:48:32,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 13:48:32,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 13:48:32,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 13:48:32,360 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 13:48:32,362 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 13:48:32,475 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 13:48:32,479 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 13:48:32,479 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-14 13:48:32,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:48:32 BoogieIcfgContainer [2023-02-14 13:48:32,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 13:48:32,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 13:48:32,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 13:48:32,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 13:48:32,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:48:31" (1/3) ... [2023-02-14 13:48:32,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a6ae02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:48:32, skipping insertion in model container [2023-02-14 13:48:32,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:32" (2/3) ... [2023-02-14 13:48:32,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a6ae02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:48:32, skipping insertion in model container [2023-02-14 13:48:32,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:48:32" (3/3) ... [2023-02-14 13:48:32,490 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2023-02-14 13:48:32,512 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 13:48:32,514 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-02-14 13:48:32,551 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 13:48:32,556 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;@646717f5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 13:48:32,556 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-02-14 13:48:32,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 27 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-14 13:48:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 13:48:32,562 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:32,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 13:48:32,563 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:32,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:32,567 INFO L85 PathProgramCache]: Analyzing trace with hash 28716783, now seen corresponding path program 1 times [2023-02-14 13:48:32,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:32,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798771186] [2023-02-14 13:48:32,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:32,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:32,655 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-14 13:48:32,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:32,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798771186] [2023-02-14 13:48:32,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798771186] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:32,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:32,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:48:32,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221298389] [2023-02-14 13:48:32,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:32,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 13:48:32,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:32,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 13:48:32,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 13:48:32,701 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 27 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) 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-14 13:48:32,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:32,718 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-02-14 13:48:32,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 13:48:32,719 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-14 13:48:32,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:32,723 INFO L225 Difference]: With dead ends: 28 [2023-02-14 13:48:32,723 INFO L226 Difference]: Without dead ends: 25 [2023-02-14 13:48:32,725 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-14 13:48:32,736 INFO L413 NwaCegarLoop]: 30 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, 30 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-14 13:48:32,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:48:32,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-14 13:48:32,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-14 13:48:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 24 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-14 13:48:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-02-14 13:48:32,755 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 5 [2023-02-14 13:48:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:32,756 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-02-14 13:48:32,756 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-14 13:48:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2023-02-14 13:48:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:48:32,756 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:32,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:48:32,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 13:48:32,757 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:32,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:32,758 INFO L85 PathProgramCache]: Analyzing trace with hash 889570012, now seen corresponding path program 1 times [2023-02-14 13:48:32,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:32,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706424618] [2023-02-14 13:48:32,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:32,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:32,788 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-14 13:48:32,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:32,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706424618] [2023-02-14 13:48:32,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706424618] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:32,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:32,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:48:32,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073254340] [2023-02-14 13:48:32,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:32,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:48:32,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:32,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:48:32,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:48:32,791 INFO L87 Difference]: Start difference. First operand 25 states and 26 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-14 13:48:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:32,812 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2023-02-14 13:48:32,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:48:32,813 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-14 13:48:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:32,814 INFO L225 Difference]: With dead ends: 39 [2023-02-14 13:48:32,814 INFO L226 Difference]: Without dead ends: 38 [2023-02-14 13:48:32,814 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-14 13:48:32,815 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:32,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 35 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:48:32,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-14 13:48:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2023-02-14 13:48:32,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 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-14 13:48:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-02-14 13:48:32,819 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 6 [2023-02-14 13:48:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:32,819 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-02-14 13:48:32,820 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-14 13:48:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-02-14 13:48:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:48:32,820 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:32,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:48:32,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 13:48:32,821 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:32,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash 889570056, now seen corresponding path program 1 times [2023-02-14 13:48:32,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:32,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2801917] [2023-02-14 13:48:32,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:32,855 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-14 13:48:32,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:32,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2801917] [2023-02-14 13:48:32,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2801917] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:32,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:32,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:48:32,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310956434] [2023-02-14 13:48:32,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:32,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:48:32,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:32,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:48:32,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:48:32,858 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 3 states, 3 states have (on average 2.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-14 13:48:32,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:32,874 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2023-02-14 13:48:32,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:48:32,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.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-14 13:48:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:32,875 INFO L225 Difference]: With dead ends: 36 [2023-02-14 13:48:32,875 INFO L226 Difference]: Without dead ends: 35 [2023-02-14 13:48:32,875 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-14 13:48:32,876 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:32,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 38 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:48:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-14 13:48:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2023-02-14 13:48:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 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-14 13:48:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2023-02-14 13:48:32,879 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 6 [2023-02-14 13:48:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:32,879 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2023-02-14 13:48:32,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.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-14 13:48:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2023-02-14 13:48:32,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:48:32,880 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:32,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:48:32,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 13:48:32,880 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:32,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:32,881 INFO L85 PathProgramCache]: Analyzing trace with hash 889571371, now seen corresponding path program 1 times [2023-02-14 13:48:32,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:32,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083300649] [2023-02-14 13:48:32,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:32,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:32,942 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-14 13:48:32,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:32,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083300649] [2023-02-14 13:48:32,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083300649] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:32,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:32,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:48:32,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118801597] [2023-02-14 13:48:32,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:32,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:48:32,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:32,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:48:32,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:48:32,946 INFO L87 Difference]: Start difference. First operand 27 states and 28 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-14 13:48:32,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:32,974 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2023-02-14 13:48:32,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:48:32,974 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-14 13:48:32,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:32,975 INFO L225 Difference]: With dead ends: 25 [2023-02-14 13:48:32,975 INFO L226 Difference]: Without dead ends: 25 [2023-02-14 13:48:32,976 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-14 13:48:32,983 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:32,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:48:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-14 13:48:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-14 13:48:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 24 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-14 13:48:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-02-14 13:48:32,986 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 6 [2023-02-14 13:48:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:32,986 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-02-14 13:48:32,986 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-14 13:48:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2023-02-14 13:48:32,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:48:32,987 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:32,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:48:32,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 13:48:32,987 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:32,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:32,988 INFO L85 PathProgramCache]: Analyzing trace with hash 889571372, now seen corresponding path program 1 times [2023-02-14 13:48:32,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:32,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977571838] [2023-02-14 13:48:32,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:32,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:33,047 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-14 13:48:33,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:33,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977571838] [2023-02-14 13:48:33,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977571838] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:33,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:33,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:48:33,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358504259] [2023-02-14 13:48:33,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:33,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:48:33,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:33,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:48:33,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:48:33,049 INFO L87 Difference]: Start difference. First operand 25 states and 26 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-14 13:48:33,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:33,063 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2023-02-14 13:48:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:48:33,063 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-14 13:48:33,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:33,064 INFO L225 Difference]: With dead ends: 23 [2023-02-14 13:48:33,064 INFO L226 Difference]: Without dead ends: 23 [2023-02-14 13:48:33,064 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-14 13:48:33,065 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:33,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 16 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:48:33,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-14 13:48:33,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-14 13:48:33,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 22 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-14 13:48:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2023-02-14 13:48:33,067 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 6 [2023-02-14 13:48:33,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:33,067 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2023-02-14 13:48:33,068 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-14 13:48:33,068 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2023-02-14 13:48:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 13:48:33,068 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:33,068 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:48:33,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 13:48:33,069 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:33,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:33,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1376170662, now seen corresponding path program 1 times [2023-02-14 13:48:33,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:33,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185293986] [2023-02-14 13:48:33,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:33,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:33,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:33,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:33,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185293986] [2023-02-14 13:48:33,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185293986] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:33,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:33,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:48:33,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804430960] [2023-02-14 13:48:33,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:33,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:48:33,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:33,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:48:33,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:48:33,114 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:33,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:33,145 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2023-02-14 13:48:33,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:48:33,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-14 13:48:33,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:33,147 INFO L225 Difference]: With dead ends: 38 [2023-02-14 13:48:33,147 INFO L226 Difference]: Without dead ends: 38 [2023-02-14 13:48:33,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:48:33,149 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:33,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 22 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:48:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-14 13:48:33,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2023-02-14 13:48:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 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-14 13:48:33,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2023-02-14 13:48:33,156 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 12 [2023-02-14 13:48:33,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:33,156 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2023-02-14 13:48:33,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2023-02-14 13:48:33,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 13:48:33,157 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:33,157 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:48:33,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 13:48:33,157 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:33,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:33,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1376170706, now seen corresponding path program 1 times [2023-02-14 13:48:33,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:33,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475759602] [2023-02-14 13:48:33,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:33,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:33,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:33,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475759602] [2023-02-14 13:48:33,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475759602] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:33,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:33,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:48:33,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286065018] [2023-02-14 13:48:33,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:33,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:48:33,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:33,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:48:33,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:48:33,240 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:33,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:33,277 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2023-02-14 13:48:33,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:48:33,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-14 13:48:33,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:33,279 INFO L225 Difference]: With dead ends: 29 [2023-02-14 13:48:33,279 INFO L226 Difference]: Without dead ends: 29 [2023-02-14 13:48:33,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:48:33,281 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:33,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 13 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:48:33,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-14 13:48:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2023-02-14 13:48:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 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-14 13:48:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2023-02-14 13:48:33,285 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 12 [2023-02-14 13:48:33,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:33,285 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-02-14 13:48:33,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2023-02-14 13:48:33,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 13:48:33,285 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:33,289 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:48:33,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 13:48:33,289 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:33,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:33,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1376170707, now seen corresponding path program 1 times [2023-02-14 13:48:33,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:33,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066639408] [2023-02-14 13:48:33,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:33,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:33,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:33,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066639408] [2023-02-14 13:48:33,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066639408] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:33,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:33,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:48:33,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060323819] [2023-02-14 13:48:33,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:33,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:48:33,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:33,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:48:33,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:48:33,429 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:33,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:33,471 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2023-02-14 13:48:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:48:33,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-14 13:48:33,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:33,473 INFO L225 Difference]: With dead ends: 33 [2023-02-14 13:48:33,473 INFO L226 Difference]: Without dead ends: 33 [2023-02-14 13:48:33,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:48:33,476 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:33,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 19 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:48:33,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-14 13:48:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2023-02-14 13:48:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 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-14 13:48:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2023-02-14 13:48:33,483 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 12 [2023-02-14 13:48:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:33,483 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-02-14 13:48:33,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2023-02-14 13:48:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-14 13:48:33,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:33,485 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:48:33,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-14 13:48:33,485 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash -349878285, now seen corresponding path program 1 times [2023-02-14 13:48:33,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:33,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533700256] [2023-02-14 13:48:33,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:33,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:33,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:33,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533700256] [2023-02-14 13:48:33,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533700256] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:33,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:33,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 13:48:33,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090244597] [2023-02-14 13:48:33,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:33,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:48:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:33,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:48:33,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:48:33,604 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:33,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:33,642 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-02-14 13:48:33,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 13:48:33,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-14 13:48:33,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:33,642 INFO L225 Difference]: With dead ends: 30 [2023-02-14 13:48:33,642 INFO L226 Difference]: Without dead ends: 30 [2023-02-14 13:48:33,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-14 13:48:33,643 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:33,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 42 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:48:33,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-14 13:48:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2023-02-14 13:48:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 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-14 13:48:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2023-02-14 13:48:33,644 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2023-02-14 13:48:33,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:33,644 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2023-02-14 13:48:33,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2023-02-14 13:48:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 13:48:33,645 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:33,645 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:48:33,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-14 13:48:33,645 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:33,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:33,645 INFO L85 PathProgramCache]: Analyzing trace with hash 666457592, now seen corresponding path program 1 times [2023-02-14 13:48:33,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:33,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174689950] [2023-02-14 13:48:33,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:33,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 13:48:33,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 13:48:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 13:48:33,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 13:48:33,670 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 13:48:33,671 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-02-14 13:48:33,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2023-02-14 13:48:33,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-02-14 13:48:33,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-02-14 13:48:33,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-02-14 13:48:33,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-02-14 13:48:33,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2023-02-14 13:48:33,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (2 of 10 remaining) [2023-02-14 13:48:33,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2023-02-14 13:48:33,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 10 remaining) [2023-02-14 13:48:33,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-14 13:48:33,674 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:48:33,676 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 13:48:33,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 01:48:33 BoogieIcfgContainer [2023-02-14 13:48:33,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 13:48:33,689 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 13:48:33,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 13:48:33,689 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 13:48:33,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:48:32" (3/4) ... [2023-02-14 13:48:33,691 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-14 13:48:33,691 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 13:48:33,691 INFO L158 Benchmark]: Toolchain (without parser) took 1776.23ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 97.8MB in the beginning and 114.3MB in the end (delta: -16.6MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2023-02-14 13:48:33,692 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 94.4MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 13:48:33,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.84ms. Allocated memory is still 134.2MB. Free memory was 97.8MB in the beginning and 81.5MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-14 13:48:33,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.28ms. Allocated memory is still 134.2MB. Free memory was 81.5MB in the beginning and 79.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 13:48:33,692 INFO L158 Benchmark]: Boogie Preprocessor took 34.02ms. Allocated memory is still 134.2MB. Free memory was 79.5MB in the beginning and 78.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 13:48:33,692 INFO L158 Benchmark]: RCFGBuilder took 271.39ms. Allocated memory is still 134.2MB. Free memory was 78.3MB in the beginning and 66.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-14 13:48:33,692 INFO L158 Benchmark]: TraceAbstraction took 1202.00ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 65.8MB in the beginning and 115.4MB in the end (delta: -49.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 13:48:33,692 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 163.6MB. Free memory was 115.4MB in the beginning and 114.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 13:48:33,693 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.13ms. Allocated memory is still 94.4MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.84ms. Allocated memory is still 134.2MB. Free memory was 97.8MB in the beginning and 81.5MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.28ms. Allocated memory is still 134.2MB. Free memory was 81.5MB in the beginning and 79.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.02ms. Allocated memory is still 134.2MB. Free memory was 79.5MB in the beginning and 78.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 271.39ms. Allocated memory is still 134.2MB. Free memory was 78.3MB in the beginning and 66.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1202.00ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 65.8MB in the beginning and 115.4MB in the end (delta: -49.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 163.6MB. Free memory was 115.4MB in the beginning and 114.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List t; [L533] List p = 0; VAL [p={0:0}] [L534] COND TRUE __VERIFIER_nondet_int() [L535] t = (List) malloc(sizeof(struct node)) [L536] COND FALSE !(t == 0) VAL [p={0:0}, t={-1:0}] [L537] t->h = 1 VAL [p={0:0}, t={-1:0}] [L538] t->n = p VAL [p={0:0}, t={-1:0}] [L539] p = t VAL [p={-1:0}, t={-1:0}] [L534] COND FALSE !(__VERIFIER_nondet_int()) [L541] COND TRUE p!=0 VAL [p={-1:0}, t={-1:0}] [L542] EXPR p->h VAL [p={-1:0}, p->h=1, t={-1:0}] [L542] COND FALSE !(p->h != 1) [L545] EXPR p->n VAL [p={-1:0}, p->n={0:0}, t={-1:0}] [L545] p = p->n [L541] COND FALSE !(p!=0) VAL [p={0:0}, t={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 183 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 160 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 267 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-14 13:48:33,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/simple_built_from_end.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 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 13:48:35,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 13:48:35,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 13:48:35,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 13:48:35,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 13:48:35,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 13:48:35,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 13:48:35,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 13:48:35,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 13:48:35,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 13:48:35,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 13:48:35,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 13:48:35,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 13:48:35,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 13:48:35,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 13:48:35,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 13:48:35,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 13:48:35,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 13:48:35,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 13:48:35,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 13:48:35,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 13:48:35,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 13:48:35,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 13:48:35,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 13:48:35,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 13:48:35,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 13:48:35,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 13:48:35,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 13:48:35,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 13:48:35,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 13:48:35,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 13:48:35,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 13:48:35,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 13:48:35,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 13:48:35,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 13:48:35,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 13:48:35,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 13:48:35,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 13:48:35,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 13:48:35,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 13:48:35,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 13:48:35,487 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-14 13:48:35,511 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 13:48:35,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 13:48:35,511 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 13:48:35,511 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 13:48:35,512 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 13:48:35,512 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 13:48:35,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 13:48:35,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 13:48:35,513 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 13:48:35,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 13:48:35,513 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 13:48:35,513 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 13:48:35,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 13:48:35,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 13:48:35,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 13:48:35,514 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 13:48:35,514 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 13:48:35,514 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 13:48:35,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 13:48:35,514 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 13:48:35,514 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-14 13:48:35,515 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-14 13:48:35,515 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 13:48:35,515 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 13:48:35,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 13:48:35,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 13:48:35,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 13:48:35,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:48:35,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 13:48:35,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 13:48:35,525 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-14 13:48:35,525 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-14 13:48:35,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 13:48:35,526 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 13:48:35,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 13:48:35,526 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-14 13:48:35,526 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 13:48:35,526 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 -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2023-02-14 13:48:35,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 13:48:35,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 13:48:35,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 13:48:35,778 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 13:48:35,778 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 13:48:35,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple_built_from_end.i [2023-02-14 13:48:36,720 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 13:48:36,908 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 13:48:36,915 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i [2023-02-14 13:48:36,923 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/565209058/6c2f869c3dab408abce6407516e6b557/FLAGafe4894e9 [2023-02-14 13:48:36,932 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/565209058/6c2f869c3dab408abce6407516e6b557 [2023-02-14 13:48:36,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 13:48:36,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 13:48:36,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 13:48:36,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 13:48:36,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 13:48:36,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:48:36" (1/1) ... [2023-02-14 13:48:36,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58aa2df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:36, skipping insertion in model container [2023-02-14 13:48:36,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:48:36" (1/1) ... [2023-02-14 13:48:36,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 13:48:36,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 13:48:37,185 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2023-02-14 13:48:37,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:48:37,199 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 13:48:37,239 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2023-02-14 13:48:37,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:48:37,262 INFO L208 MainTranslator]: Completed translation [2023-02-14 13:48:37,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:37 WrapperNode [2023-02-14 13:48:37,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 13:48:37,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 13:48:37,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 13:48:37,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 13:48:37,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:37" (1/1) ... [2023-02-14 13:48:37,281 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:37" (1/1) ... [2023-02-14 13:48:37,291 INFO L138 Inliner]: procedures = 127, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2023-02-14 13:48:37,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 13:48:37,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 13:48:37,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 13:48:37,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 13:48:37,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:37" (1/1) ... [2023-02-14 13:48:37,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:37" (1/1) ... [2023-02-14 13:48:37,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:37" (1/1) ... [2023-02-14 13:48:37,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:37" (1/1) ... [2023-02-14 13:48:37,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:37" (1/1) ... [2023-02-14 13:48:37,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:37" (1/1) ... [2023-02-14 13:48:37,308 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:37" (1/1) ... [2023-02-14 13:48:37,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:37" (1/1) ... [2023-02-14 13:48:37,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 13:48:37,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 13:48:37,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 13:48:37,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 13:48:37,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:37" (1/1) ... [2023-02-14 13:48:37,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:48:37,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:48:37,336 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-14 13:48:37,337 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-14 13:48:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-14 13:48:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 13:48:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 13:48:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 13:48:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 13:48:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-14 13:48:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-14 13:48:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 13:48:37,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 13:48:37,437 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 13:48:37,438 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 13:48:37,569 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 13:48:37,574 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 13:48:37,574 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-14 13:48:37,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:48:37 BoogieIcfgContainer [2023-02-14 13:48:37,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 13:48:37,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 13:48:37,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 13:48:37,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 13:48:37,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:48:36" (1/3) ... [2023-02-14 13:48:37,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7a7d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:48:37, skipping insertion in model container [2023-02-14 13:48:37,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:48:37" (2/3) ... [2023-02-14 13:48:37,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7a7d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:48:37, skipping insertion in model container [2023-02-14 13:48:37,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:48:37" (3/3) ... [2023-02-14 13:48:37,587 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2023-02-14 13:48:37,598 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 13:48:37,609 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-02-14 13:48:37,646 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 13:48:37,651 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;@3a17384b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 13:48:37,652 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-02-14 13:48:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 2.0) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 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-14 13:48:37,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 13:48:37,659 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:37,659 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 13:48:37,660 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:37,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:37,665 INFO L85 PathProgramCache]: Analyzing trace with hash 28698492, now seen corresponding path program 1 times [2023-02-14 13:48:37,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 13:48:37,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632417989] [2023-02-14 13:48:37,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:37,674 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-14 13:48:37,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 13:48:37,676 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-14 13:48:37,677 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-14 13:48:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:37,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 13:48:37,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:37,791 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-14 13:48:37,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:48:37,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 13:48:37,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632417989] [2023-02-14 13:48:37,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632417989] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:37,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:37,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:48:37,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495461179] [2023-02-14 13:48:37,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:37,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:48:37,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 13:48:37,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:48:37,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:48:37,833 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 2.0) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:37,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:37,894 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2023-02-14 13:48:37,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:48:37,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-14 13:48:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:37,901 INFO L225 Difference]: With dead ends: 40 [2023-02-14 13:48:37,901 INFO L226 Difference]: Without dead ends: 36 [2023-02-14 13:48:37,902 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-14 13:48:37,906 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:37,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 38 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:48:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-02-14 13:48:37,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2023-02-14 13:48:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.85) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 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-14 13:48:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-02-14 13:48:37,930 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 5 [2023-02-14 13:48:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:37,930 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-02-14 13:48:37,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-02-14 13:48:37,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 13:48:37,931 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:37,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 13:48:37,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-14 13:48:38,138 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-14 13:48:38,139 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:38,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:38,140 INFO L85 PathProgramCache]: Analyzing trace with hash 28698536, now seen corresponding path program 1 times [2023-02-14 13:48:38,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 13:48:38,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991760438] [2023-02-14 13:48:38,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:38,141 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-14 13:48:38,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 13:48:38,143 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-14 13:48:38,145 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-14 13:48:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:38,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-14 13:48:38,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:38,225 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-14 13:48:38,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:48:38,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 13:48:38,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991760438] [2023-02-14 13:48:38,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991760438] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:38,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:38,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:48:38,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521893786] [2023-02-14 13:48:38,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:38,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:48:38,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 13:48:38,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:48:38,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:48:38,231 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:38,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:38,268 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2023-02-14 13:48:38,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:48:38,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-14 13:48:38,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:38,270 INFO L225 Difference]: With dead ends: 34 [2023-02-14 13:48:38,270 INFO L226 Difference]: Without dead ends: 33 [2023-02-14 13:48:38,270 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-14 13:48:38,271 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:38,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 36 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:48:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-14 13:48:38,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2023-02-14 13:48:38,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 24 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-14 13:48:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-02-14 13:48:38,274 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 5 [2023-02-14 13:48:38,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:38,274 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-02-14 13:48:38,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2023-02-14 13:48:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 13:48:38,274 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:38,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 13:48:38,283 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-14 13:48:38,480 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-14 13:48:38,480 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:38,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:38,481 INFO L85 PathProgramCache]: Analyzing trace with hash 28699851, now seen corresponding path program 1 times [2023-02-14 13:48:38,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 13:48:38,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039469383] [2023-02-14 13:48:38,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:38,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-14 13:48:38,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 13:48:38,486 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-14 13:48:38,489 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-14 13:48:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:38,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-14 13:48:38,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:38,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 13:48:38,621 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-14 13:48:38,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:48:38,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 13:48:38,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039469383] [2023-02-14 13:48:38,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039469383] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:38,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:38,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:48:38,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963033550] [2023-02-14 13:48:38,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:38,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:48:38,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 13:48:38,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:48:38,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:48:38,628 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:38,667 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2023-02-14 13:48:38,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:48:38,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-14 13:48:38,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:38,669 INFO L225 Difference]: With dead ends: 23 [2023-02-14 13:48:38,669 INFO L226 Difference]: Without dead ends: 23 [2023-02-14 13:48:38,670 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-14 13:48:38,672 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:38,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 12 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:48:38,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-14 13:48:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-14 13:48:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.6) internal successors, (24), 22 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-14 13:48:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2023-02-14 13:48:38,679 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 5 [2023-02-14 13:48:38,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:38,680 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2023-02-14 13:48:38,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:38,680 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2023-02-14 13:48:38,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 13:48:38,681 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:38,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 13:48:38,691 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-14 13:48:38,888 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-14 13:48:38,889 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:38,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:38,889 INFO L85 PathProgramCache]: Analyzing trace with hash 28699852, now seen corresponding path program 1 times [2023-02-14 13:48:38,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 13:48:38,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334752955] [2023-02-14 13:48:38,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:38,890 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-14 13:48:38,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 13:48:38,891 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-14 13:48:38,894 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-14 13:48:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:38,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 13:48:38,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:38,930 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-14 13:48:38,941 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-14 13:48:38,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:48:38,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 13:48:38,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334752955] [2023-02-14 13:48:38,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334752955] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:38,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:38,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:48:38,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170274401] [2023-02-14 13:48:38,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:38,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:48:38,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 13:48:38,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:48:38,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:48:38,944 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:38,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:38,972 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2023-02-14 13:48:38,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:48:38,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-14 13:48:38,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:38,973 INFO L225 Difference]: With dead ends: 21 [2023-02-14 13:48:38,973 INFO L226 Difference]: Without dead ends: 21 [2023-02-14 13:48:38,974 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-14 13:48:38,974 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:38,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 13 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:48:38,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-14 13:48:38,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-14 13:48:38,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 20 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-14 13:48:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-02-14 13:48:38,977 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 5 [2023-02-14 13:48:38,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:38,977 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-02-14 13:48:38,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:38,977 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-02-14 13:48:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 13:48:38,978 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:38,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:48:38,986 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-14 13:48:39,184 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-14 13:48:39,185 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:39,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:39,185 INFO L85 PathProgramCache]: Analyzing trace with hash -653129230, now seen corresponding path program 1 times [2023-02-14 13:48:39,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 13:48:39,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583118757] [2023-02-14 13:48:39,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:39,186 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-14 13:48:39,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 13:48:39,190 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-14 13:48:39,192 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-14 13:48:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:39,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-14 13:48:39,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:39,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:48:39,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 13:48:39,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583118757] [2023-02-14 13:48:39,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583118757] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:39,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:39,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:48:39,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116248036] [2023-02-14 13:48:39,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:39,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:48:39,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 13:48:39,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:48:39,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:48:39,287 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.5) 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-14 13:48:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:39,362 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2023-02-14 13:48:39,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:48:39,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) 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-14 13:48:39,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:39,365 INFO L225 Difference]: With dead ends: 36 [2023-02-14 13:48:39,365 INFO L226 Difference]: Without dead ends: 36 [2023-02-14 13:48:39,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-14 13:48:39,366 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:39,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 18 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:48:39,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-02-14 13:48:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2023-02-14 13:48:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.4375) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2023-02-14 13:48:39,368 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2023-02-14 13:48:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:39,369 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2023-02-14 13:48:39,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) 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-14 13:48:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2023-02-14 13:48:39,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 13:48:39,369 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:39,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:48:39,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-14 13:48:39,576 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-14 13:48:39,577 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:39,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:39,577 INFO L85 PathProgramCache]: Analyzing trace with hash -653129186, now seen corresponding path program 1 times [2023-02-14 13:48:39,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 13:48:39,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293805714] [2023-02-14 13:48:39,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:39,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 13:48:39,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 13:48:39,579 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-14 13:48:39,581 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-14 13:48:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:39,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 13:48:39,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:39,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 13:48:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:39,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:48:39,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 13:48:39,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293805714] [2023-02-14 13:48:39,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293805714] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:39,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:39,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:48:39,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10877552] [2023-02-14 13:48:39,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:39,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:48:39,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 13:48:39,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:48:39,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:48:39,666 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) 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-14 13:48:39,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:39,732 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2023-02-14 13:48:39,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:48:39,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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-14 13:48:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:39,733 INFO L225 Difference]: With dead ends: 27 [2023-02-14 13:48:39,733 INFO L226 Difference]: Without dead ends: 27 [2023-02-14 13:48:39,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-14 13:48:39,734 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:39,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 9 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:48:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-14 13:48:39,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2023-02-14 13:48:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 21 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-14 13:48:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-02-14 13:48:39,736 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 10 [2023-02-14 13:48:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:39,736 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-02-14 13:48:39,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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-14 13:48:39,736 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-02-14 13:48:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 13:48:39,736 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:39,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:48:39,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-14 13:48:39,936 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-14 13:48:39,937 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:39,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:39,937 INFO L85 PathProgramCache]: Analyzing trace with hash -653129185, now seen corresponding path program 1 times [2023-02-14 13:48:39,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 13:48:39,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706400628] [2023-02-14 13:48:39,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:39,937 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-14 13:48:39,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 13:48:39,938 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-14 13:48:39,939 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-14 13:48:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:39,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 13:48:39,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:39,981 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-14 13:48:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:40,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:48:40,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 13:48:40,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706400628] [2023-02-14 13:48:40,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706400628] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:40,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:40,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:48:40,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262741853] [2023-02-14 13:48:40,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:40,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:48:40,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 13:48:40,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:48:40,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:48:40,018 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) 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-14 13:48:40,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:40,081 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2023-02-14 13:48:40,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:48:40,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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-14 13:48:40,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:40,082 INFO L225 Difference]: With dead ends: 31 [2023-02-14 13:48:40,082 INFO L226 Difference]: Without dead ends: 31 [2023-02-14 13:48:40,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-14 13:48:40,083 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:40,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 15 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:48:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-14 13:48:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2023-02-14 13:48:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 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-14 13:48:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2023-02-14 13:48:40,085 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 10 [2023-02-14 13:48:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:40,085 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-02-14 13:48:40,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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-14 13:48:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2023-02-14 13:48:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 13:48:40,085 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:40,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:48:40,093 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-14 13:48:40,285 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-14 13:48:40,286 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:40,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:40,286 INFO L85 PathProgramCache]: Analyzing trace with hash -591922145, now seen corresponding path program 1 times [2023-02-14 13:48:40,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 13:48:40,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839446652] [2023-02-14 13:48:40,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:40,287 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-14 13:48:40,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 13:48:40,287 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-14 13:48:40,288 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-14 13:48:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:40,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 13:48:40,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:40,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:48:40,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 13:48:40,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:48:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:40,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 13:48:40,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 13:48:40,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839446652] [2023-02-14 13:48:40,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839446652] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:40,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:40,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 13:48:40,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127854780] [2023-02-14 13:48:40,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:40,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:48:40,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 13:48:40,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:48:40,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:48:40,395 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.4) 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-14 13:48:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:40,478 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2023-02-14 13:48:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 13:48:40,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) 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-14 13:48:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:40,479 INFO L225 Difference]: With dead ends: 28 [2023-02-14 13:48:40,479 INFO L226 Difference]: Without dead ends: 28 [2023-02-14 13:48:40,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-14 13:48:40,479 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:40,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 36 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:48:40,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-14 13:48:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2023-02-14 13:48:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 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-14 13:48:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2023-02-14 13:48:40,481 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 12 [2023-02-14 13:48:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:40,481 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2023-02-14 13:48:40,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) 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-14 13:48:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2023-02-14 13:48:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 13:48:40,482 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:40,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:48:40,491 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-14 13:48:40,682 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-14 13:48:40,682 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-02-14 13:48:40,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:40,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1187913323, now seen corresponding path program 1 times [2023-02-14 13:48:40,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 13:48:40,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722331312] [2023-02-14 13:48:40,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:40,683 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-14 13:48:40,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 13:48:40,684 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-14 13:48:40,684 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-14 13:48:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 13:48:40,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 13:48:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 13:48:40,765 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-14 13:48:40,765 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 13:48:40,766 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-02-14 13:48:40,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2023-02-14 13:48:40,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-02-14 13:48:40,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-02-14 13:48:40,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-02-14 13:48:40,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-02-14 13:48:40,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2023-02-14 13:48:40,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (2 of 10 remaining) [2023-02-14 13:48:40,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2023-02-14 13:48:40,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 10 remaining) [2023-02-14 13:48:40,774 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-14 13:48:40,968 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-14 13:48:40,970 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:48:40,972 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 13:48:40,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 01:48:40 BoogieIcfgContainer [2023-02-14 13:48:40,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 13:48:40,987 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 13:48:40,987 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 13:48:40,987 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 13:48:40,987 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:48:37" (3/4) ... [2023-02-14 13:48:40,989 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-14 13:48:40,989 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 13:48:40,989 INFO L158 Benchmark]: Toolchain (without parser) took 4053.57ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 47.0MB in the beginning and 63.3MB in the end (delta: -16.3MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2023-02-14 13:48:40,989 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 73.4MB. Free memory is still 51.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 13:48:40,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.54ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 46.8MB in the beginning and 79.3MB in the end (delta: -32.5MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2023-02-14 13:48:40,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.38ms. Allocated memory is still 104.9MB. Free memory was 79.3MB in the beginning and 77.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 13:48:40,990 INFO L158 Benchmark]: Boogie Preprocessor took 17.95ms. Allocated memory is still 104.9MB. Free memory was 77.7MB in the beginning and 76.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 13:48:40,990 INFO L158 Benchmark]: RCFGBuilder took 270.84ms. Allocated memory is still 104.9MB. Free memory was 76.0MB in the beginning and 63.0MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-14 13:48:40,990 INFO L158 Benchmark]: TraceAbstraction took 3403.79ms. Allocated memory is still 104.9MB. Free memory was 62.6MB in the beginning and 63.9MB in the end (delta: -1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 13:48:40,990 INFO L158 Benchmark]: Witness Printer took 2.09ms. Allocated memory is still 104.9MB. Free memory was 63.9MB in the beginning and 63.3MB in the end (delta: 572.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 13:48:40,991 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.16ms. Allocated memory is still 73.4MB. Free memory is still 51.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.54ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 46.8MB in the beginning and 79.3MB in the end (delta: -32.5MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.38ms. Allocated memory is still 104.9MB. Free memory was 79.3MB in the beginning and 77.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.95ms. Allocated memory is still 104.9MB. Free memory was 77.7MB in the beginning and 76.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 270.84ms. Allocated memory is still 104.9MB. Free memory was 76.0MB in the beginning and 63.0MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3403.79ms. Allocated memory is still 104.9MB. Free memory was 62.6MB in the beginning and 63.9MB in the end (delta: -1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.09ms. Allocated memory is still 104.9MB. Free memory was 63.9MB in the beginning and 63.3MB in the end (delta: 572.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List t; [L533] List p = 0; VAL [p={0:0}] [L534] COND TRUE __VERIFIER_nondet_int() [L535] t = (List) malloc(sizeof(struct node)) [L536] COND FALSE !(t == 0) VAL [p={0:0}, t={6:0}] [L537] t->h = 1 VAL [p={0:0}, t={6:0}] [L538] t->n = p VAL [p={0:0}, t={6:0}] [L539] p = t VAL [p={6:0}, t={6:0}] [L534] COND FALSE !(__VERIFIER_nondet_int()) [L541] COND TRUE p!=0 VAL [p={6:0}, t={6:0}] [L542] EXPR p->h VAL [p={6:0}, p->h=1, t={6:0}] [L542] COND FALSE !(p->h != 1) [L545] EXPR p->n VAL [p={6:0}, p->n={0:0}, t={6:0}] [L545] p = p->n [L541] COND FALSE !(p!=0) VAL [p={0:0}, t={6:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 119 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=1, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 248 SizeOfPredicates, 9 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 4/4 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-14 13:48:41,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample