./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_15-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 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/locks/test_locks_15-1.c -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 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:43:22,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:43:22,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:43:22,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:43:22,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:43:22,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:43:22,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:43:22,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:43:22,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:43:22,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:43:22,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:43:22,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:43:22,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:43:22,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:43:22,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:43:22,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:43:22,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:43:22,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:43:22,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:43:22,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:43:22,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:43:22,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:43:22,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:43:22,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:43:22,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:43:22,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:43:22,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:43:22,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:43:22,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:43:22,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:43:22,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:43:22,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:43:22,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:43:22,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:43:22,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:43:22,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:43:22,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:43:22,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:43:22,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:43:22,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:43:22,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:43:22,711 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:43:22,728 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:43:22,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:43:22,733 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:43:22,733 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:43:22,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:43:22,734 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:43:22,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:43:22,734 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:43:22,734 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:43:22,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:43:22,735 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:43:22,735 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:43:22,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:43:22,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:43:22,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:43:22,736 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:43:22,736 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:43:22,736 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:43:22,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:43:22,736 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:43:22,736 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:43:22,737 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:43:22,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:43:22,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:43:22,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:43:22,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:43:22,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:43:22,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:43:22,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:43:22,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:43:22,738 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:43:22,738 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:43:22,738 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:43:22,738 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:43:22,738 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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2023-02-15 01:43:22,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:43:22,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:43:22,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:43:22,976 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:43:22,976 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:43:22,976 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2023-02-15 01:43:23,924 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:43:24,115 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:43:24,115 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2023-02-15 01:43:24,121 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfaf3cc02/3ae09db3c12542d59fbd702873b97c70/FLAGa6bad0fe0 [2023-02-15 01:43:24,133 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfaf3cc02/3ae09db3c12542d59fbd702873b97c70 [2023-02-15 01:43:24,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:43:24,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:43:24,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:43:24,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:43:24,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:43:24,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:43:24" (1/1) ... [2023-02-15 01:43:24,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359b68f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:24, skipping insertion in model container [2023-02-15 01:43:24,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:43:24" (1/1) ... [2023-02-15 01:43:24,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:43:24,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:43:24,325 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/locks/test_locks_15-1.c[5654,5667] [2023-02-15 01:43:24,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:43:24,339 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:43:24,370 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/locks/test_locks_15-1.c[5654,5667] [2023-02-15 01:43:24,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:43:24,384 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:43:24,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:24 WrapperNode [2023-02-15 01:43:24,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:43:24,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:43:24,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:43:24,386 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:43:24,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:24" (1/1) ... [2023-02-15 01:43:24,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:24" (1/1) ... [2023-02-15 01:43:24,425 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 195 [2023-02-15 01:43:24,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:43:24,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:43:24,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:43:24,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:43:24,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:24" (1/1) ... [2023-02-15 01:43:24,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:24" (1/1) ... [2023-02-15 01:43:24,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:24" (1/1) ... [2023-02-15 01:43:24,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:24" (1/1) ... [2023-02-15 01:43:24,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:24" (1/1) ... [2023-02-15 01:43:24,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:24" (1/1) ... [2023-02-15 01:43:24,458 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:24" (1/1) ... [2023-02-15 01:43:24,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:24" (1/1) ... [2023-02-15 01:43:24,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:43:24,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:43:24,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:43:24,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:43:24,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:24" (1/1) ... [2023-02-15 01:43:24,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:43:24,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:43:24,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 01:43:24,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 01:43:24,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:43:24,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:43:24,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:43:24,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:43:24,599 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:43:24,601 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:43:24,800 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:43:24,804 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:43:24,804 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 01:43:24,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:43:24 BoogieIcfgContainer [2023-02-15 01:43:24,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:43:24,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:43:24,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:43:24,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:43:24,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:43:24" (1/3) ... [2023-02-15 01:43:24,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0b9ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:43:24, skipping insertion in model container [2023-02-15 01:43:24,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:24" (2/3) ... [2023-02-15 01:43:24,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0b9ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:43:24, skipping insertion in model container [2023-02-15 01:43:24,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:43:24" (3/3) ... [2023-02-15 01:43:24,811 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2023-02-15 01:43:24,821 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:43:24,821 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-02-15 01:43:24,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:43:24,867 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;@2cf3b8ba, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:43:24,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-02-15 01:43:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:24,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 01:43:24,874 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:24,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 01:43:24,875 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:24,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:24,879 INFO L85 PathProgramCache]: Analyzing trace with hash 28959891, now seen corresponding path program 1 times [2023-02-15 01:43:24,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:43:24,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477201793] [2023-02-15 01:43:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:24,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:43:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:24,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:43:24,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477201793] [2023-02-15 01:43:24,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477201793] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:24,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:24,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:43:24,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184254863] [2023-02-15 01:43:24,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:24,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 01:43:24,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:43:25,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 01:43:25,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:43:25,018 INFO L87 Difference]: Start difference. First operand has 56 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-15 01:43:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:25,035 INFO L93 Difference]: Finished difference Result 56 states and 100 transitions. [2023-02-15 01:43:25,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 01:43:25,038 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-15 01:43:25,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:25,044 INFO L225 Difference]: With dead ends: 56 [2023-02-15 01:43:25,044 INFO L226 Difference]: Without dead ends: 54 [2023-02-15 01:43:25,046 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-15 01:43:25,050 INFO L413 NwaCegarLoop]: 100 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, 100 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-15 01:43:25,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:25,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-15 01:43:25,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-02-15 01:43:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 98 transitions. [2023-02-15 01:43:25,073 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 98 transitions. Word has length 5 [2023-02-15 01:43:25,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:25,074 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 98 transitions. [2023-02-15 01:43:25,074 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-15 01:43:25,074 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 98 transitions. [2023-02-15 01:43:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:43:25,074 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:25,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:43:25,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:43:25,075 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:25,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:25,076 INFO L85 PathProgramCache]: Analyzing trace with hash 889700683, now seen corresponding path program 1 times [2023-02-15 01:43:25,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:43:25,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20221429] [2023-02-15 01:43:25,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:25,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:43:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:25,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:43:25,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20221429] [2023-02-15 01:43:25,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20221429] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:25,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:25,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:43:25,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227469096] [2023-02-15 01:43:25,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:25,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:25,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:43:25,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:25,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:25,151 INFO L87 Difference]: Start difference. First operand 54 states and 98 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-15 01:43:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:25,159 INFO L93 Difference]: Finished difference Result 53 states and 97 transitions. [2023-02-15 01:43:25,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:25,160 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-15 01:43:25,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:25,160 INFO L225 Difference]: With dead ends: 53 [2023-02-15 01:43:25,160 INFO L226 Difference]: Without dead ends: 51 [2023-02-15 01:43:25,161 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-15 01:43:25,162 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:43:25,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 97 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-15 01:43:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-15 01:43:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 95 transitions. [2023-02-15 01:43:25,166 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 95 transitions. Word has length 6 [2023-02-15 01:43:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:25,167 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 95 transitions. [2023-02-15 01:43:25,167 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-15 01:43:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 95 transitions. [2023-02-15 01:43:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 01:43:25,168 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:25,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:43:25,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:43:25,168 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:25,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1188553263, now seen corresponding path program 1 times [2023-02-15 01:43:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:43:25,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600624256] [2023-02-15 01:43:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:25,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:43:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:25,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:43:25,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600624256] [2023-02-15 01:43:25,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600624256] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:25,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:25,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:43:25,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233219653] [2023-02-15 01:43:25,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:25,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:25,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:43:25,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:25,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:25,226 INFO L87 Difference]: Start difference. First operand 51 states and 95 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-15 01:43:25,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:25,244 INFO L93 Difference]: Finished difference Result 99 states and 184 transitions. [2023-02-15 01:43:25,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:25,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 01:43:25,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:25,246 INFO L225 Difference]: With dead ends: 99 [2023-02-15 01:43:25,246 INFO L226 Difference]: Without dead ends: 99 [2023-02-15 01:43:25,246 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-15 01:43:25,247 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 76 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:43:25,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 240 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-15 01:43:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2023-02-15 01:43:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.90625) internal successors, (183), 96 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:25,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 183 transitions. [2023-02-15 01:43:25,255 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 183 transitions. Word has length 22 [2023-02-15 01:43:25,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:25,256 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 183 transitions. [2023-02-15 01:43:25,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-15 01:43:25,256 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 183 transitions. [2023-02-15 01:43:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 01:43:25,256 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:25,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:43:25,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:43:25,257 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:25,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:25,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1188560455, now seen corresponding path program 1 times [2023-02-15 01:43:25,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:43:25,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561364174] [2023-02-15 01:43:25,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:25,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:43:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:25,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:43:25,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561364174] [2023-02-15 01:43:25,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561364174] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:25,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:25,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:43:25,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329880460] [2023-02-15 01:43:25,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:25,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:25,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:43:25,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:25,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:25,340 INFO L87 Difference]: Start difference. First operand 97 states and 183 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-15 01:43:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:25,349 INFO L93 Difference]: Finished difference Result 98 states and 184 transitions. [2023-02-15 01:43:25,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:25,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 01:43:25,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:25,351 INFO L225 Difference]: With dead ends: 98 [2023-02-15 01:43:25,351 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 01:43:25,351 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-15 01:43:25,352 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 14 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:43:25,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 184 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 01:43:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-15 01:43:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.8969072164948453) internal successors, (184), 97 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 184 transitions. [2023-02-15 01:43:25,358 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 184 transitions. Word has length 22 [2023-02-15 01:43:25,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:25,358 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 184 transitions. [2023-02-15 01:43:25,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-15 01:43:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 184 transitions. [2023-02-15 01:43:25,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 01:43:25,359 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:25,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:43:25,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:43:25,360 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:25,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:25,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1112269327, now seen corresponding path program 1 times [2023-02-15 01:43:25,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:43:25,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387639600] [2023-02-15 01:43:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:25,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:43:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:25,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:43:25,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387639600] [2023-02-15 01:43:25,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387639600] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:25,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:25,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:43:25,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312399030] [2023-02-15 01:43:25,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:25,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:25,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:43:25,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:25,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:25,399 INFO L87 Difference]: Start difference. First operand 98 states and 184 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-15 01:43:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:25,409 INFO L93 Difference]: Finished difference Result 137 states and 251 transitions. [2023-02-15 01:43:25,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:25,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 01:43:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:25,410 INFO L225 Difference]: With dead ends: 137 [2023-02-15 01:43:25,410 INFO L226 Difference]: Without dead ends: 137 [2023-02-15 01:43:25,411 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-15 01:43:25,411 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 76 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:43:25,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-15 01:43:25,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-02-15 01:43:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.8656716417910448) internal successors, (250), 134 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 250 transitions. [2023-02-15 01:43:25,418 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 250 transitions. Word has length 22 [2023-02-15 01:43:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:25,418 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 250 transitions. [2023-02-15 01:43:25,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-15 01:43:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 250 transitions. [2023-02-15 01:43:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 01:43:25,419 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:25,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:43:25,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:43:25,420 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:25,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1112262135, now seen corresponding path program 1 times [2023-02-15 01:43:25,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:43:25,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772808399] [2023-02-15 01:43:25,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:25,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:43:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:25,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:43:25,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772808399] [2023-02-15 01:43:25,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772808399] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:25,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:25,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:43:25,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424153682] [2023-02-15 01:43:25,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:25,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:25,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:43:25,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:25,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:25,452 INFO L87 Difference]: Start difference. First operand 135 states and 250 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-15 01:43:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:25,463 INFO L93 Difference]: Finished difference Result 135 states and 244 transitions. [2023-02-15 01:43:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:25,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 01:43:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:25,464 INFO L225 Difference]: With dead ends: 135 [2023-02-15 01:43:25,464 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 01:43:25,464 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-15 01:43:25,465 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 74 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:43:25,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 01:43:25,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2023-02-15 01:43:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.8409090909090908) internal successors, (243), 132 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 243 transitions. [2023-02-15 01:43:25,471 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 243 transitions. Word has length 22 [2023-02-15 01:43:25,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:25,471 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 243 transitions. [2023-02-15 01:43:25,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-15 01:43:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 243 transitions. [2023-02-15 01:43:25,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 01:43:25,472 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:25,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:43:25,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 01:43:25,473 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:25,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:25,473 INFO L85 PathProgramCache]: Analyzing trace with hash -476078575, now seen corresponding path program 1 times [2023-02-15 01:43:25,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:43:25,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342485445] [2023-02-15 01:43:25,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:25,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:43:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 01:43:25,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 01:43:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 01:43:25,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 01:43:25,510 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 01:43:25,511 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2023-02-15 01:43:25,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2023-02-15 01:43:25,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 01:43:25,515 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:43:25,517 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 01:43:25,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:43:25 BoogieIcfgContainer [2023-02-15 01:43:25,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 01:43:25,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 01:43:25,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 01:43:25,561 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 01:43:25,562 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:43:24" (3/4) ... [2023-02-15 01:43:25,563 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 01:43:25,568 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 01:43:25,568 INFO L158 Benchmark]: Toolchain (without parser) took 1432.61ms. Allocated memory is still 144.7MB. Free memory was 110.8MB in the beginning and 80.6MB in the end (delta: 30.1MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2023-02-15 01:43:25,569 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 119.5MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:43:25,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.14ms. Allocated memory is still 144.7MB. Free memory was 110.5MB in the beginning and 98.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 01:43:25,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.34ms. Allocated memory is still 144.7MB. Free memory was 98.8MB in the beginning and 97.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 01:43:25,570 INFO L158 Benchmark]: Boogie Preprocessor took 37.13ms. Allocated memory is still 144.7MB. Free memory was 97.1MB in the beginning and 95.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 01:43:25,570 INFO L158 Benchmark]: RCFGBuilder took 342.07ms. Allocated memory is still 144.7MB. Free memory was 95.4MB in the beginning and 104.2MB in the end (delta: -8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 01:43:25,570 INFO L158 Benchmark]: TraceAbstraction took 753.64ms. Allocated memory is still 144.7MB. Free memory was 103.4MB in the beginning and 80.6MB in the end (delta: 22.7MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2023-02-15 01:43:25,570 INFO L158 Benchmark]: Witness Printer took 7.02ms. Allocated memory is still 144.7MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:43:25,572 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.08ms. Allocated memory is still 119.5MB. Free memory is still 92.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.14ms. Allocated memory is still 144.7MB. Free memory was 110.5MB in the beginning and 98.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.34ms. Allocated memory is still 144.7MB. Free memory was 98.8MB in the beginning and 97.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.13ms. Allocated memory is still 144.7MB. Free memory was 97.1MB in the beginning and 95.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 342.07ms. Allocated memory is still 144.7MB. Free memory was 95.4MB in the beginning and 104.2MB in the end (delta: -8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 753.64ms. Allocated memory is still 144.7MB. Free memory was 103.4MB in the beginning and 80.6MB in the end (delta: 22.7MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * Witness Printer took 7.02ms. Allocated memory is still 144.7MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 233]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 233. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; VAL [p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L93] COND FALSE !(p1 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L97] COND FALSE !(p2 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L101] COND FALSE !(p3 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L105] COND TRUE p4 != 0 [L106] lk4 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L109] COND TRUE p5 != 0 [L110] lk5 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L113] COND TRUE p6 != 0 [L114] lk6 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L117] COND TRUE p7 != 0 [L118] lk7 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L121] COND TRUE p8 != 0 [L122] lk8 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L125] COND TRUE p9 != 0 [L126] lk9 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L129] COND TRUE p10 != 0 [L130] lk10 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L133] COND FALSE !(p11 != 0) VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L137] COND TRUE p12 != 0 [L138] lk12 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L141] COND TRUE p13 != 0 [L142] lk13 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L145] COND TRUE p14 != 0 [L146] lk14 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L149] COND TRUE p15 != 0 [L150] lk15 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L155] COND FALSE !(p1 != 0) VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L160] COND FALSE !(p2 != 0) VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L233] reach_error() VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 967 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 303 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 664 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=5, InterpolantAutomatonStates: 17, 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, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-15 01:43:25,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_15-1.c -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 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:43:27,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:43:27,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:43:27,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:43:27,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:43:27,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:43:27,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:43:27,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:43:27,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:43:27,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:43:27,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:43:27,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:43:27,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:43:27,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:43:27,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:43:27,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:43:27,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:43:27,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:43:27,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:43:27,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:43:27,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:43:27,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:43:27,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:43:27,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:43:27,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:43:27,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:43:27,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:43:27,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:43:27,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:43:27,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:43:27,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:43:27,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:43:27,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:43:27,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:43:27,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:43:27,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:43:27,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:43:27,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:43:27,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:43:27,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:43:27,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:43:27,775 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 01:43:27,801 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:43:27,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:43:27,802 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:43:27,803 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:43:27,803 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:43:27,804 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:43:27,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:43:27,804 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:43:27,804 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:43:27,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:43:27,805 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:43:27,806 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:43:27,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:43:27,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:43:27,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:43:27,806 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:43:27,806 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:43:27,806 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:43:27,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:43:27,807 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:43:27,807 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 01:43:27,807 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 01:43:27,807 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:43:27,808 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:43:27,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:43:27,808 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:43:27,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:43:27,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:43:27,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:43:27,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:43:27,809 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 01:43:27,809 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 01:43:27,809 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:43:27,809 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:43:27,809 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:43:27,810 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 01:43:27,810 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:43:27,810 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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2023-02-15 01:43:28,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:43:28,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:43:28,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:43:28,099 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:43:28,107 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:43:28,109 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2023-02-15 01:43:29,110 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:43:29,296 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:43:29,296 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2023-02-15 01:43:29,302 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79cde1642/30025a6e17224a3c9b0a23c754c46acd/FLAG333f72a3d [2023-02-15 01:43:29,329 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79cde1642/30025a6e17224a3c9b0a23c754c46acd [2023-02-15 01:43:29,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:43:29,332 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:43:29,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:43:29,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:43:29,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:43:29,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:43:29" (1/1) ... [2023-02-15 01:43:29,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a4ca40a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:29, skipping insertion in model container [2023-02-15 01:43:29,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:43:29" (1/1) ... [2023-02-15 01:43:29,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:43:29,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:43:29,522 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/locks/test_locks_15-1.c[5654,5667] [2023-02-15 01:43:29,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:43:29,545 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:43:29,579 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/locks/test_locks_15-1.c[5654,5667] [2023-02-15 01:43:29,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:43:29,609 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:43:29,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:29 WrapperNode [2023-02-15 01:43:29,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:43:29,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:43:29,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:43:29,611 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:43:29,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:29" (1/1) ... [2023-02-15 01:43:29,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:29" (1/1) ... [2023-02-15 01:43:29,652 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 179 [2023-02-15 01:43:29,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:43:29,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:43:29,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:43:29,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:43:29,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:29" (1/1) ... [2023-02-15 01:43:29,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:29" (1/1) ... [2023-02-15 01:43:29,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:29" (1/1) ... [2023-02-15 01:43:29,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:29" (1/1) ... [2023-02-15 01:43:29,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:29" (1/1) ... [2023-02-15 01:43:29,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:29" (1/1) ... [2023-02-15 01:43:29,690 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:29" (1/1) ... [2023-02-15 01:43:29,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:29" (1/1) ... [2023-02-15 01:43:29,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:43:29,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:43:29,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:43:29,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:43:29,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:29" (1/1) ... [2023-02-15 01:43:29,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:43:29,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:43:29,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 01:43:29,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 01:43:29,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:43:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:43:29,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:43:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 01:43:29,858 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:43:29,860 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:43:30,103 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:43:30,107 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:43:30,107 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 01:43:30,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:43:30 BoogieIcfgContainer [2023-02-15 01:43:30,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:43:30,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:43:30,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:43:30,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:43:30,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:43:29" (1/3) ... [2023-02-15 01:43:30,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4358eab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:43:30, skipping insertion in model container [2023-02-15 01:43:30,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:29" (2/3) ... [2023-02-15 01:43:30,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4358eab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:43:30, skipping insertion in model container [2023-02-15 01:43:30,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:43:30" (3/3) ... [2023-02-15 01:43:30,115 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2023-02-15 01:43:30,128 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:43:30,129 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-02-15 01:43:30,162 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:43:30,167 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;@28f46061, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:43:30,168 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-02-15 01:43:30,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 01:43:30,178 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:30,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 01:43:30,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:30,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash 28959891, now seen corresponding path program 1 times [2023-02-15 01:43:30,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:43:30,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610371981] [2023-02-15 01:43:30,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:30,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:30,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:43:30,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:43:30,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 01:43:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:30,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 01:43:30,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:43:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:30,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:43:30,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:43:30,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610371981] [2023-02-15 01:43:30,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610371981] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:30,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:30,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:43:30,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094436638] [2023-02-15 01:43:30,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:30,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 01:43:30,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:43:30,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 01:43:30,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:43:30,377 INFO L87 Difference]: Start difference. First operand has 56 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-15 01:43:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:30,396 INFO L93 Difference]: Finished difference Result 56 states and 100 transitions. [2023-02-15 01:43:30,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 01:43:30,399 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-15 01:43:30,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:30,405 INFO L225 Difference]: With dead ends: 56 [2023-02-15 01:43:30,406 INFO L226 Difference]: Without dead ends: 54 [2023-02-15 01:43:30,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-15 01:43:30,410 INFO L413 NwaCegarLoop]: 100 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, 100 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-15 01:43:30,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:30,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-15 01:43:30,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-02-15 01:43:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 98 transitions. [2023-02-15 01:43:30,448 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 98 transitions. Word has length 5 [2023-02-15 01:43:30,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:30,448 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 98 transitions. [2023-02-15 01:43:30,448 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-15 01:43:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 98 transitions. [2023-02-15 01:43:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:43:30,449 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:30,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:43:30,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 01:43:30,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:30,657 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:30,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:30,658 INFO L85 PathProgramCache]: Analyzing trace with hash 889700683, now seen corresponding path program 1 times [2023-02-15 01:43:30,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:43:30,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062026623] [2023-02-15 01:43:30,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:30,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:30,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:43:30,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:43:30,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 01:43:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:30,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 01:43:30,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:43:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:30,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:43:30,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:43:30,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062026623] [2023-02-15 01:43:30,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062026623] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:30,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:30,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:43:30,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944228547] [2023-02-15 01:43:30,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:30,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:30,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:43:30,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:30,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:30,739 INFO L87 Difference]: Start difference. First operand 54 states and 98 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-15 01:43:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:30,746 INFO L93 Difference]: Finished difference Result 53 states and 97 transitions. [2023-02-15 01:43:30,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:30,747 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-15 01:43:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:30,748 INFO L225 Difference]: With dead ends: 53 [2023-02-15 01:43:30,748 INFO L226 Difference]: Without dead ends: 51 [2023-02-15 01:43:30,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:30,749 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:43:30,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 97 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:30,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-15 01:43:30,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-15 01:43:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 95 transitions. [2023-02-15 01:43:30,753 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 95 transitions. Word has length 6 [2023-02-15 01:43:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:30,754 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 95 transitions. [2023-02-15 01:43:30,754 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-15 01:43:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 95 transitions. [2023-02-15 01:43:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 01:43:30,755 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:30,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:43:30,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 01:43:30,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:30,962 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:30,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:30,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1188553263, now seen corresponding path program 1 times [2023-02-15 01:43:30,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:43:30,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226194628] [2023-02-15 01:43:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:30,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:30,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:43:30,965 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:43:30,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 01:43:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:31,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 01:43:31,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:43:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:31,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:43:31,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:43:31,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226194628] [2023-02-15 01:43:31,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226194628] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:31,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:31,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:43:31,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923354640] [2023-02-15 01:43:31,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:31,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:31,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:43:31,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:31,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:31,037 INFO L87 Difference]: Start difference. First operand 51 states and 95 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-15 01:43:31,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:31,054 INFO L93 Difference]: Finished difference Result 99 states and 184 transitions. [2023-02-15 01:43:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:31,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 01:43:31,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:31,055 INFO L225 Difference]: With dead ends: 99 [2023-02-15 01:43:31,056 INFO L226 Difference]: Without dead ends: 99 [2023-02-15 01:43:31,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-15 01:43:31,057 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 76 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:43:31,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 240 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-15 01:43:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2023-02-15 01:43:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.90625) internal successors, (183), 96 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 183 transitions. [2023-02-15 01:43:31,064 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 183 transitions. Word has length 22 [2023-02-15 01:43:31,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:31,065 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 183 transitions. [2023-02-15 01:43:31,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-15 01:43:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 183 transitions. [2023-02-15 01:43:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 01:43:31,066 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:31,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:43:31,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 01:43:31,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:31,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:31,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:31,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1188560455, now seen corresponding path program 1 times [2023-02-15 01:43:31,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:43:31,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011002119] [2023-02-15 01:43:31,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:31,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:31,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:43:31,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:43:31,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 01:43:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:31,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 01:43:31,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:43:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:31,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:43:31,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:43:31,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011002119] [2023-02-15 01:43:31,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011002119] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:31,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:31,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:43:31,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976666426] [2023-02-15 01:43:31,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:31,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:31,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:43:31,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:31,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:31,338 INFO L87 Difference]: Start difference. First operand 97 states and 183 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-15 01:43:31,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:31,348 INFO L93 Difference]: Finished difference Result 98 states and 184 transitions. [2023-02-15 01:43:31,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:31,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 01:43:31,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:31,349 INFO L225 Difference]: With dead ends: 98 [2023-02-15 01:43:31,349 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 01:43:31,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-15 01:43:31,350 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 14 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:43:31,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 184 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:31,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 01:43:31,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-15 01:43:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.8969072164948453) internal successors, (184), 97 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 184 transitions. [2023-02-15 01:43:31,357 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 184 transitions. Word has length 22 [2023-02-15 01:43:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:31,358 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 184 transitions. [2023-02-15 01:43:31,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-15 01:43:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 184 transitions. [2023-02-15 01:43:31,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 01:43:31,358 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:31,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:43:31,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 01:43:31,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:31,566 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:31,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:31,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1112269327, now seen corresponding path program 1 times [2023-02-15 01:43:31,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:43:31,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432350170] [2023-02-15 01:43:31,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:31,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:31,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:43:31,570 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:43:31,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 01:43:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:31,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 01:43:31,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:43:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:31,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:43:31,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:43:31,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432350170] [2023-02-15 01:43:31,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432350170] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:31,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:31,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:43:31,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497311827] [2023-02-15 01:43:31,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:31,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:31,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:43:31,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:31,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:31,684 INFO L87 Difference]: Start difference. First operand 98 states and 184 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-15 01:43:31,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:31,693 INFO L93 Difference]: Finished difference Result 137 states and 251 transitions. [2023-02-15 01:43:31,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:31,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 01:43:31,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:31,695 INFO L225 Difference]: With dead ends: 137 [2023-02-15 01:43:31,703 INFO L226 Difference]: Without dead ends: 137 [2023-02-15 01:43:31,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-15 01:43:31,704 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 76 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:43:31,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:31,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-15 01:43:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-02-15 01:43:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.8656716417910448) internal successors, (250), 134 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 250 transitions. [2023-02-15 01:43:31,724 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 250 transitions. Word has length 22 [2023-02-15 01:43:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:31,725 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 250 transitions. [2023-02-15 01:43:31,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-15 01:43:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 250 transitions. [2023-02-15 01:43:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 01:43:31,726 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:31,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:43:31,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 01:43:31,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:31,933 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:31,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:31,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1112262135, now seen corresponding path program 1 times [2023-02-15 01:43:31,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:43:31,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042653951] [2023-02-15 01:43:31,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:31,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:31,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:43:31,936 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:43:31,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 01:43:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:31,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 01:43:31,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:43:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:31,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:43:31,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:43:31,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042653951] [2023-02-15 01:43:31,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042653951] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:31,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:31,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:43:31,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070576336] [2023-02-15 01:43:31,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:31,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:31,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:43:31,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:31,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:31,998 INFO L87 Difference]: Start difference. First operand 135 states and 250 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-15 01:43:32,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:32,007 INFO L93 Difference]: Finished difference Result 135 states and 244 transitions. [2023-02-15 01:43:32,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:32,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 01:43:32,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:32,009 INFO L225 Difference]: With dead ends: 135 [2023-02-15 01:43:32,009 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 01:43:32,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-15 01:43:32,010 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 74 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:43:32,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 01:43:32,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2023-02-15 01:43:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.8409090909090908) internal successors, (243), 132 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 243 transitions. [2023-02-15 01:43:32,018 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 243 transitions. Word has length 22 [2023-02-15 01:43:32,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:32,018 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 243 transitions. [2023-02-15 01:43:32,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-15 01:43:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 243 transitions. [2023-02-15 01:43:32,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 01:43:32,019 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:32,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:43:32,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-02-15 01:43:32,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:32,226 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:32,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:32,227 INFO L85 PathProgramCache]: Analyzing trace with hash -476078575, now seen corresponding path program 1 times [2023-02-15 01:43:32,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:43:32,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663668958] [2023-02-15 01:43:32,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:32,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:32,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:43:32,229 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:43:32,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 01:43:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 01:43:32,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 01:43:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 01:43:32,294 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 01:43:32,294 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 01:43:32,295 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2023-02-15 01:43:32,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2023-02-15 01:43:32,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 01:43:32,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:32,506 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:43:32,508 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 01:43:32,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:43:32 BoogieIcfgContainer [2023-02-15 01:43:32,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 01:43:32,550 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 01:43:32,550 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 01:43:32,555 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 01:43:32,556 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:43:30" (3/4) ... [2023-02-15 01:43:32,558 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 01:43:32,558 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 01:43:32,558 INFO L158 Benchmark]: Toolchain (without parser) took 3226.14ms. Allocated memory is still 92.3MB. Free memory was 69.4MB in the beginning and 70.0MB in the end (delta: -646.5kB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2023-02-15 01:43:32,558 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 67.1MB. Free memory is still 43.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:43:32,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.70ms. Allocated memory is still 92.3MB. Free memory was 69.1MB in the beginning and 56.7MB in the end (delta: 12.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 01:43:32,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.87ms. Allocated memory is still 92.3MB. Free memory was 56.7MB in the beginning and 54.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 01:43:32,559 INFO L158 Benchmark]: Boogie Preprocessor took 44.12ms. Allocated memory is still 92.3MB. Free memory was 54.7MB in the beginning and 53.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:43:32,559 INFO L158 Benchmark]: RCFGBuilder took 411.57ms. Allocated memory is still 92.3MB. Free memory was 53.1MB in the beginning and 59.1MB in the end (delta: -6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 01:43:32,560 INFO L158 Benchmark]: TraceAbstraction took 2439.31ms. Allocated memory is still 92.3MB. Free memory was 58.4MB in the beginning and 38.9MB in the end (delta: 19.5MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2023-02-15 01:43:32,560 INFO L158 Benchmark]: Witness Printer took 7.76ms. Allocated memory is still 92.3MB. Free memory was 38.9MB in the beginning and 70.0MB in the end (delta: -31.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 01:43:32,561 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 67.1MB. Free memory is still 43.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.70ms. Allocated memory is still 92.3MB. Free memory was 69.1MB in the beginning and 56.7MB in the end (delta: 12.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.87ms. Allocated memory is still 92.3MB. Free memory was 56.7MB in the beginning and 54.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.12ms. Allocated memory is still 92.3MB. Free memory was 54.7MB in the beginning and 53.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 411.57ms. Allocated memory is still 92.3MB. Free memory was 53.1MB in the beginning and 59.1MB in the end (delta: -6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2439.31ms. Allocated memory is still 92.3MB. Free memory was 58.4MB in the beginning and 38.9MB in the end (delta: 19.5MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Witness Printer took 7.76ms. Allocated memory is still 92.3MB. Free memory was 38.9MB in the beginning and 70.0MB in the end (delta: -31.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 233]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 233. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0] [L93] COND FALSE !(p1 != 0) VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0] [L97] COND FALSE !(p2 != 0) VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0] [L101] COND FALSE !(p3 != 0) VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0] [L105] COND TRUE p4 != 0 [L106] lk4 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2] [L109] COND TRUE p5 != 0 [L110] lk5 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2] [L113] COND TRUE p6 != 0 [L114] lk6 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2] [L117] COND TRUE p7 != 0 [L118] lk7 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2] [L121] COND TRUE p8 != 0 [L122] lk8 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2] [L125] COND TRUE p9 != 0 [L126] lk9 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L129] COND TRUE p10 != 0 [L130] lk10 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L133] COND FALSE !(p11 != 0) VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L137] COND TRUE p12 != 0 [L138] lk12 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L141] COND TRUE p13 != 0 [L142] lk13 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L145] COND TRUE p14 != 0 [L146] lk14 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L149] COND TRUE p15 != 0 [L150] lk15 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L155] COND FALSE !(p1 != 0) VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L160] COND FALSE !(p2 != 0) VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L233] reach_error() VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 967 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 303 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 664 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=5, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 287 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-15 01:43:32,581 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