./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 2329fc70 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-?-2329fc7 [2023-02-14 02:26:23,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 02:26:23,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 02:26:24,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 02:26:24,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 02:26:24,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 02:26:24,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 02:26:24,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 02:26:24,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 02:26:24,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 02:26:24,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 02:26:24,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 02:26:24,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 02:26:24,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 02:26:24,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 02:26:24,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 02:26:24,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 02:26:24,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 02:26:24,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 02:26:24,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 02:26:24,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 02:26:24,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 02:26:24,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 02:26:24,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 02:26:24,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 02:26:24,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 02:26:24,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 02:26:24,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 02:26:24,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 02:26:24,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 02:26:24,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 02:26:24,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 02:26:24,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 02:26:24,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 02:26:24,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 02:26:24,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 02:26:24,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 02:26:24,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 02:26:24,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 02:26:24,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 02:26:24,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 02:26:24,080 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 02:26:24,110 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 02:26:24,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 02:26:24,111 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 02:26:24,111 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 02:26:24,112 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 02:26:24,112 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 02:26:24,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 02:26:24,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 02:26:24,113 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 02:26:24,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 02:26:24,114 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 02:26:24,114 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 02:26:24,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 02:26:24,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 02:26:24,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 02:26:24,115 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 02:26:24,115 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 02:26:24,115 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 02:26:24,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 02:26:24,115 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 02:26:24,115 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 02:26:24,115 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 02:26:24,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 02:26:24,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 02:26:24,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 02:26:24,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:26:24,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 02:26:24,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 02:26:24,116 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 02:26:24,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 02:26:24,117 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 02:26:24,117 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 02:26:24,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 02:26:24,117 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 02:26:24,117 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-14 02:26:24,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 02:26:24,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 02:26:24,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 02:26:24,387 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 02:26:24,387 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 02:26:24,388 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-14 02:26:25,629 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 02:26:25,775 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 02:26:25,775 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2023-02-14 02:26:25,781 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293d346a7/90eb0de754f147ad9705cee2e012e686/FLAG64e2b8852 [2023-02-14 02:26:25,792 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293d346a7/90eb0de754f147ad9705cee2e012e686 [2023-02-14 02:26:25,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 02:26:25,795 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 02:26:25,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 02:26:25,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 02:26:25,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 02:26:25,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:26:25" (1/1) ... [2023-02-14 02:26:25,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21cbc871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:25, skipping insertion in model container [2023-02-14 02:26:25,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:26:25" (1/1) ... [2023-02-14 02:26:25,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 02:26:25,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 02:26:26,006 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-14 02:26:26,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:26:26,024 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 02:26:26,043 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-14 02:26:26,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:26:26,062 INFO L208 MainTranslator]: Completed translation [2023-02-14 02:26:26,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:26 WrapperNode [2023-02-14 02:26:26,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 02:26:26,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 02:26:26,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 02:26:26,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 02:26:26,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:26" (1/1) ... [2023-02-14 02:26:26,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:26" (1/1) ... [2023-02-14 02:26:26,111 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 195 [2023-02-14 02:26:26,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 02:26:26,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 02:26:26,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 02:26:26,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 02:26:26,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:26" (1/1) ... [2023-02-14 02:26:26,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:26" (1/1) ... [2023-02-14 02:26:26,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:26" (1/1) ... [2023-02-14 02:26:26,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:26" (1/1) ... [2023-02-14 02:26:26,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:26" (1/1) ... [2023-02-14 02:26:26,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:26" (1/1) ... [2023-02-14 02:26:26,139 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:26" (1/1) ... [2023-02-14 02:26:26,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:26" (1/1) ... [2023-02-14 02:26:26,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 02:26:26,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 02:26:26,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 02:26:26,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 02:26:26,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:26" (1/1) ... [2023-02-14 02:26:26,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:26:26,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:26:26,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 02:26:26,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 02:26:26,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 02:26:26,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 02:26:26,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 02:26:26,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 02:26:26,285 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 02:26:26,286 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 02:26:26,618 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 02:26:26,635 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 02:26:26,635 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-14 02:26:26,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:26:26 BoogieIcfgContainer [2023-02-14 02:26:26,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 02:26:26,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 02:26:26,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 02:26:26,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 02:26:26,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 02:26:25" (1/3) ... [2023-02-14 02:26:26,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a9197d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:26:26, skipping insertion in model container [2023-02-14 02:26:26,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:26" (2/3) ... [2023-02-14 02:26:26,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a9197d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:26:26, skipping insertion in model container [2023-02-14 02:26:26,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:26:26" (3/3) ... [2023-02-14 02:26:26,643 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2023-02-14 02:26:26,656 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 02:26:26,657 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-02-14 02:26:26,699 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 02:26:26,703 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;@54743779, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 02:26:26,704 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-02-14 02:26:26,707 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-14 02:26:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 02:26:26,711 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:26:26,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 02:26:26,713 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 02:26:26,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:26:26,718 INFO L85 PathProgramCache]: Analyzing trace with hash 28959891, now seen corresponding path program 1 times [2023-02-14 02:26:26,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:26:26,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107093733] [2023-02-14 02:26:26,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:26:26,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:26:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:26:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:26:26,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:26:26,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107093733] [2023-02-14 02:26:26,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107093733] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:26:26,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:26:26,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:26:26,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907538435] [2023-02-14 02:26:26,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:26:26,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 02:26:26,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:26:26,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 02:26:26,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 02:26:26,955 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-14 02:26:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:26:26,986 INFO L93 Difference]: Finished difference Result 56 states and 100 transitions. [2023-02-14 02:26:26,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 02:26:26,991 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-14 02:26:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:26:27,006 INFO L225 Difference]: With dead ends: 56 [2023-02-14 02:26:27,007 INFO L226 Difference]: Without dead ends: 54 [2023-02-14 02:26:27,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 02:26:27,014 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-14 02:26:27,017 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-14 02:26:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-14 02:26:27,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-02-14 02:26:27,056 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-14 02:26:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 98 transitions. [2023-02-14 02:26:27,062 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 98 transitions. Word has length 5 [2023-02-14 02:26:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:26:27,063 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 98 transitions. [2023-02-14 02:26:27,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:26:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 98 transitions. [2023-02-14 02:26:27,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 02:26:27,064 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:26:27,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 02:26:27,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 02:26:27,065 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 02:26:27,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:26:27,069 INFO L85 PathProgramCache]: Analyzing trace with hash 889700683, now seen corresponding path program 1 times [2023-02-14 02:26:27,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:26:27,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765016623] [2023-02-14 02:26:27,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:26:27,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:26:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:26:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:26:27,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:26:27,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765016623] [2023-02-14 02:26:27,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765016623] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:26:27,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:26:27,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:26:27,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609764244] [2023-02-14 02:26:27,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:26:27,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:26:27,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:26:27,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:26:27,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:26:27,202 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-14 02:26:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:26:27,226 INFO L93 Difference]: Finished difference Result 53 states and 97 transitions. [2023-02-14 02:26:27,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:26:27,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 02:26:27,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:26:27,229 INFO L225 Difference]: With dead ends: 53 [2023-02-14 02:26:27,229 INFO L226 Difference]: Without dead ends: 51 [2023-02-14 02:26:27,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:26:27,235 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-14 02:26:27,236 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-14 02:26:27,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-14 02:26:27,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-14 02:26:27,249 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-14 02:26:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 95 transitions. [2023-02-14 02:26:27,253 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 95 transitions. Word has length 6 [2023-02-14 02:26:27,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:26:27,253 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 95 transitions. [2023-02-14 02:26:27,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:26:27,254 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 95 transitions. [2023-02-14 02:26:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 02:26:27,256 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:26:27,256 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-14 02:26:27,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 02:26:27,257 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 02:26:27,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:26:27,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1188553263, now seen corresponding path program 1 times [2023-02-14 02:26:27,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:26:27,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98760907] [2023-02-14 02:26:27,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:26:27,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:26:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:26:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:26:27,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:26:27,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98760907] [2023-02-14 02:26:27,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98760907] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:26:27,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:26:27,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:26:27,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886865853] [2023-02-14 02:26:27,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:26:27,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:26:27,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:26:27,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:26:27,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:26:27,342 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-14 02:26:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:26:27,363 INFO L93 Difference]: Finished difference Result 99 states and 184 transitions. [2023-02-14 02:26:27,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:26:27,364 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-14 02:26:27,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:26:27,365 INFO L225 Difference]: With dead ends: 99 [2023-02-14 02:26:27,365 INFO L226 Difference]: Without dead ends: 99 [2023-02-14 02:26:27,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:26:27,366 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-14 02:26:27,366 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-14 02:26:27,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-14 02:26:27,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2023-02-14 02:26:27,372 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-14 02:26:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 183 transitions. [2023-02-14 02:26:27,373 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 183 transitions. Word has length 22 [2023-02-14 02:26:27,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:26:27,374 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 183 transitions. [2023-02-14 02:26:27,374 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-14 02:26:27,374 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 183 transitions. [2023-02-14 02:26:27,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 02:26:27,375 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:26:27,375 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-14 02:26:27,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 02:26:27,375 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 02:26:27,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:26:27,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1188560455, now seen corresponding path program 1 times [2023-02-14 02:26:27,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:26:27,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619177989] [2023-02-14 02:26:27,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:26:27,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:26:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:26:27,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:26:27,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:26:27,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619177989] [2023-02-14 02:26:27,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619177989] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:26:27,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:26:27,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:26:27,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666238191] [2023-02-14 02:26:27,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:26:27,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:26:27,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:26:27,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:26:27,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:26:27,451 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-14 02:26:27,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:26:27,467 INFO L93 Difference]: Finished difference Result 98 states and 184 transitions. [2023-02-14 02:26:27,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:26:27,468 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-14 02:26:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:26:27,469 INFO L225 Difference]: With dead ends: 98 [2023-02-14 02:26:27,469 INFO L226 Difference]: Without dead ends: 98 [2023-02-14 02:26:27,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:26:27,470 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-14 02:26:27,471 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-14 02:26:27,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-14 02:26:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-14 02:26:27,478 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-14 02:26:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 184 transitions. [2023-02-14 02:26:27,480 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 184 transitions. Word has length 22 [2023-02-14 02:26:27,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:26:27,481 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 184 transitions. [2023-02-14 02:26:27,481 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-14 02:26:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 184 transitions. [2023-02-14 02:26:27,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 02:26:27,482 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:26:27,482 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-14 02:26:27,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 02:26:27,483 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 02:26:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:26:27,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1112269327, now seen corresponding path program 1 times [2023-02-14 02:26:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:26:27,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643990626] [2023-02-14 02:26:27,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:26:27,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:26:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:26:27,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:26:27,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:26:27,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643990626] [2023-02-14 02:26:27,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643990626] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:26:27,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:26:27,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:26:27,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963746941] [2023-02-14 02:26:27,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:26:27,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:26:27,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:26:27,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:26:27,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:26:27,523 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-14 02:26:27,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:26:27,538 INFO L93 Difference]: Finished difference Result 137 states and 251 transitions. [2023-02-14 02:26:27,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:26:27,538 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-14 02:26:27,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:26:27,539 INFO L225 Difference]: With dead ends: 137 [2023-02-14 02:26:27,539 INFO L226 Difference]: Without dead ends: 137 [2023-02-14 02:26:27,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:26:27,540 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-14 02:26:27,541 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-14 02:26:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-14 02:26:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-02-14 02:26:27,546 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-14 02:26:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 250 transitions. [2023-02-14 02:26:27,548 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 250 transitions. Word has length 22 [2023-02-14 02:26:27,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:26:27,548 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 250 transitions. [2023-02-14 02:26:27,548 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-14 02:26:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 250 transitions. [2023-02-14 02:26:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 02:26:27,549 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:26:27,549 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-14 02:26:27,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 02:26:27,550 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 02:26:27,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:26:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1112262135, now seen corresponding path program 1 times [2023-02-14 02:26:27,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:26:27,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648937421] [2023-02-14 02:26:27,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:26:27,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:26:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:26:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:26:27,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:26:27,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648937421] [2023-02-14 02:26:27,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648937421] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:26:27,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:26:27,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:26:27,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512206107] [2023-02-14 02:26:27,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:26:27,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:26:27,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:26:27,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:26:27,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:26:27,589 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-14 02:26:27,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:26:27,606 INFO L93 Difference]: Finished difference Result 135 states and 244 transitions. [2023-02-14 02:26:27,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:26:27,607 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-14 02:26:27,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:26:27,608 INFO L225 Difference]: With dead ends: 135 [2023-02-14 02:26:27,608 INFO L226 Difference]: Without dead ends: 135 [2023-02-14 02:26:27,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:26:27,610 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-14 02:26:27,610 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-14 02:26:27,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-14 02:26:27,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2023-02-14 02:26:27,627 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-14 02:26:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 243 transitions. [2023-02-14 02:26:27,628 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 243 transitions. Word has length 22 [2023-02-14 02:26:27,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:26:27,629 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 243 transitions. [2023-02-14 02:26:27,629 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-14 02:26:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 243 transitions. [2023-02-14 02:26:27,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 02:26:27,630 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:26:27,630 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-14 02:26:27,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 02:26:27,630 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 02:26:27,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:26:27,631 INFO L85 PathProgramCache]: Analyzing trace with hash -476078575, now seen corresponding path program 1 times [2023-02-14 02:26:27,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:26:27,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67259449] [2023-02-14 02:26:27,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:26:27,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:26:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 02:26:27,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 02:26:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 02:26:27,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 02:26:27,702 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 02:26:27,703 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2023-02-14 02:26:27,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2023-02-14 02:26:27,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 02:26:27,706 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:26:27,708 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 02:26:27,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 02:26:27 BoogieIcfgContainer [2023-02-14 02:26:27,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 02:26:27,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 02:26:27,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 02:26:27,769 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 02:26:27,769 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:26:26" (3/4) ... [2023-02-14 02:26:27,772 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-14 02:26:27,772 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 02:26:27,773 INFO L158 Benchmark]: Toolchain (without parser) took 1977.62ms. Allocated memory is still 136.3MB. Free memory was 91.3MB in the beginning and 103.8MB in the end (delta: -12.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 02:26:27,773 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 136.3MB. Free memory is still 112.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 02:26:27,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.56ms. Allocated memory is still 136.3MB. Free memory was 91.3MB in the beginning and 79.8MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-14 02:26:27,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.97ms. Allocated memory is still 136.3MB. Free memory was 79.8MB in the beginning and 77.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 02:26:27,775 INFO L158 Benchmark]: Boogie Preprocessor took 34.16ms. Allocated memory is still 136.3MB. Free memory was 77.7MB in the beginning and 76.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 02:26:27,777 INFO L158 Benchmark]: RCFGBuilder took 490.37ms. Allocated memory is still 136.3MB. Free memory was 76.1MB in the beginning and 59.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-14 02:26:27,777 INFO L158 Benchmark]: TraceAbstraction took 1129.25ms. Allocated memory is still 136.3MB. Free memory was 58.8MB in the beginning and 103.8MB in the end (delta: -45.0MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2023-02-14 02:26:27,779 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 136.3MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 02:26:27,780 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 136.3MB. Free memory is still 112.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.56ms. Allocated memory is still 136.3MB. Free memory was 91.3MB in the beginning and 79.8MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.97ms. Allocated memory is still 136.3MB. Free memory was 79.8MB in the beginning and 77.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.16ms. Allocated memory is still 136.3MB. Free memory was 77.7MB in the beginning and 76.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 490.37ms. Allocated memory is still 136.3MB. Free memory was 76.1MB in the beginning and 59.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1129.25ms. Allocated memory is still 136.3MB. Free memory was 58.8MB in the beginning and 103.8MB in the end (delta: -45.0MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 136.3MB. Free memory is still 103.8MB. 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: 1.0s, 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, 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s 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-14 02:26:27,805 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-?-2329fc7 [2023-02-14 02:26:30,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 02:26:30,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 02:26:30,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 02:26:30,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 02:26:30,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 02:26:30,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 02:26:30,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 02:26:30,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 02:26:30,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 02:26:30,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 02:26:30,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 02:26:30,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 02:26:30,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 02:26:30,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 02:26:30,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 02:26:30,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 02:26:30,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 02:26:30,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 02:26:30,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 02:26:30,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 02:26:30,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 02:26:30,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 02:26:30,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 02:26:30,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 02:26:30,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 02:26:30,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 02:26:30,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 02:26:30,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 02:26:30,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 02:26:30,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 02:26:30,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 02:26:30,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 02:26:30,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 02:26:30,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 02:26:30,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 02:26:30,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 02:26:30,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 02:26:30,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 02:26:30,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 02:26:30,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 02:26:30,237 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-14 02:26:30,253 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 02:26:30,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 02:26:30,254 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 02:26:30,254 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 02:26:30,255 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 02:26:30,255 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 02:26:30,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 02:26:30,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 02:26:30,256 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 02:26:30,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 02:26:30,256 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 02:26:30,256 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 02:26:30,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 02:26:30,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 02:26:30,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 02:26:30,257 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 02:26:30,257 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 02:26:30,257 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 02:26:30,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 02:26:30,257 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 02:26:30,258 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-14 02:26:30,258 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-14 02:26:30,258 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 02:26:30,258 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 02:26:30,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 02:26:30,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 02:26:30,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 02:26:30,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:26:30,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 02:26:30,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 02:26:30,259 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-14 02:26:30,259 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-14 02:26:30,259 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 02:26:30,260 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 02:26:30,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 02:26:30,260 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-14 02:26:30,260 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 02:26:30,260 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-14 02:26:30,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 02:26:30,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 02:26:30,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 02:26:30,589 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 02:26:30,590 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 02:26:30,595 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-14 02:26:31,761 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 02:26:32,009 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 02:26:32,010 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2023-02-14 02:26:32,040 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/310d7ec15/677bde65cd6944fcb6f0bfa61153d519/FLAG42c3eea8e [2023-02-14 02:26:32,055 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/310d7ec15/677bde65cd6944fcb6f0bfa61153d519 [2023-02-14 02:26:32,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 02:26:32,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 02:26:32,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 02:26:32,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 02:26:32,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 02:26:32,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:26:32" (1/1) ... [2023-02-14 02:26:32,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b1ef6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:32, skipping insertion in model container [2023-02-14 02:26:32,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:26:32" (1/1) ... [2023-02-14 02:26:32,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 02:26:32,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 02:26:32,241 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-14 02:26:32,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:26:32,268 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 02:26:32,299 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-14 02:26:32,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:26:32,320 INFO L208 MainTranslator]: Completed translation [2023-02-14 02:26:32,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:32 WrapperNode [2023-02-14 02:26:32,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 02:26:32,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 02:26:32,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 02:26:32,322 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 02:26:32,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:32" (1/1) ... [2023-02-14 02:26:32,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:32" (1/1) ... [2023-02-14 02:26:32,365 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 179 [2023-02-14 02:26:32,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 02:26:32,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 02:26:32,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 02:26:32,368 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 02:26:32,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:32" (1/1) ... [2023-02-14 02:26:32,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:32" (1/1) ... [2023-02-14 02:26:32,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:32" (1/1) ... [2023-02-14 02:26:32,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:32" (1/1) ... [2023-02-14 02:26:32,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:32" (1/1) ... [2023-02-14 02:26:32,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:32" (1/1) ... [2023-02-14 02:26:32,410 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:32" (1/1) ... [2023-02-14 02:26:32,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:32" (1/1) ... [2023-02-14 02:26:32,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 02:26:32,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 02:26:32,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 02:26:32,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 02:26:32,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:32" (1/1) ... [2023-02-14 02:26:32,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:26:32,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:26:32,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 02:26:32,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 02:26:32,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 02:26:32,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 02:26:32,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 02:26:32,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-14 02:26:32,584 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 02:26:32,588 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 02:26:32,788 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 02:26:32,793 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 02:26:32,793 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-14 02:26:32,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:26:32 BoogieIcfgContainer [2023-02-14 02:26:32,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 02:26:32,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 02:26:32,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 02:26:32,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 02:26:32,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 02:26:32" (1/3) ... [2023-02-14 02:26:32,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210a2fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:26:32, skipping insertion in model container [2023-02-14 02:26:32,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:26:32" (2/3) ... [2023-02-14 02:26:32,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210a2fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:26:32, skipping insertion in model container [2023-02-14 02:26:32,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:26:32" (3/3) ... [2023-02-14 02:26:32,809 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2023-02-14 02:26:32,824 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 02:26:32,825 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-02-14 02:26:32,867 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 02:26:32,873 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;@70ae5d19, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 02:26:32,874 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-02-14 02:26:32,878 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-14 02:26:32,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 02:26:32,884 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:26:32,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 02:26:32,886 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 02:26:32,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:26:32,892 INFO L85 PathProgramCache]: Analyzing trace with hash 28959891, now seen corresponding path program 1 times [2023-02-14 02:26:32,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:26:32,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061807944] [2023-02-14 02:26:32,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:26:32,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:26:32,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:26:32,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:26:32,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-14 02:26:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:26:32,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-14 02:26:32,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:26:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:26:33,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:26:33,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:26:33,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061807944] [2023-02-14 02:26:33,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061807944] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:26:33,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:26:33,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:26:33,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207309975] [2023-02-14 02:26:33,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:26:33,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 02:26:33,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:26:33,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 02:26:33,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 02:26:33,058 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-14 02:26:33,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:26:33,079 INFO L93 Difference]: Finished difference Result 56 states and 100 transitions. [2023-02-14 02:26:33,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 02:26:33,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-14 02:26:33,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:26:33,091 INFO L225 Difference]: With dead ends: 56 [2023-02-14 02:26:33,091 INFO L226 Difference]: Without dead ends: 54 [2023-02-14 02:26:33,094 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-14 02:26:33,097 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-14 02:26:33,099 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-14 02:26:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-14 02:26:33,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-02-14 02:26:33,126 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-14 02:26:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 98 transitions. [2023-02-14 02:26:33,131 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 98 transitions. Word has length 5 [2023-02-14 02:26:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:26:33,131 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 98 transitions. [2023-02-14 02:26:33,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:26:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 98 transitions. [2023-02-14 02:26:33,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 02:26:33,132 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:26:33,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 02:26:33,141 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-14 02:26:33,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:26:33,342 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 02:26:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:26:33,344 INFO L85 PathProgramCache]: Analyzing trace with hash 889700683, now seen corresponding path program 1 times [2023-02-14 02:26:33,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:26:33,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070310834] [2023-02-14 02:26:33,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:26:33,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:26:33,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:26:33,346 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:26:33,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-14 02:26:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:26:33,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 02:26:33,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:26:33,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-14 02:26:33,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:26:33,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:26:33,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070310834] [2023-02-14 02:26:33,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070310834] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:26:33,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:26:33,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:26:33,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195764833] [2023-02-14 02:26:33,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:26:33,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:26:33,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:26:33,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:26:33,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:26:33,400 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-14 02:26:33,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:26:33,408 INFO L93 Difference]: Finished difference Result 53 states and 97 transitions. [2023-02-14 02:26:33,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:26:33,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 02:26:33,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:26:33,409 INFO L225 Difference]: With dead ends: 53 [2023-02-14 02:26:33,410 INFO L226 Difference]: Without dead ends: 51 [2023-02-14 02:26:33,410 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-14 02:26:33,411 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-14 02:26:33,411 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-14 02:26:33,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-14 02:26:33,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-14 02:26:33,414 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-14 02:26:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 95 transitions. [2023-02-14 02:26:33,415 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 95 transitions. Word has length 6 [2023-02-14 02:26:33,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:26:33,416 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 95 transitions. [2023-02-14 02:26:33,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:26:33,416 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 95 transitions. [2023-02-14 02:26:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 02:26:33,417 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:26:33,417 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-14 02:26:33,425 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 (3)] Ended with exit code 0 [2023-02-14 02:26:33,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:26:33,630 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 02:26:33,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:26:33,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1188553263, now seen corresponding path program 1 times [2023-02-14 02:26:33,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:26:33,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061905255] [2023-02-14 02:26:33,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:26:33,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:26:33,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:26:33,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:26:33,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-14 02:26:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:26:33,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 02:26:33,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:26:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:26:33,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:26:33,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:26:33,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061905255] [2023-02-14 02:26:33,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061905255] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:26:33,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:26:33,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:26:33,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630680497] [2023-02-14 02:26:33,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:26:33,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:26:33,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:26:33,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:26:33,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:26:33,810 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-14 02:26:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:26:33,829 INFO L93 Difference]: Finished difference Result 99 states and 184 transitions. [2023-02-14 02:26:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:26:33,829 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-14 02:26:33,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:26:33,831 INFO L225 Difference]: With dead ends: 99 [2023-02-14 02:26:33,831 INFO L226 Difference]: Without dead ends: 99 [2023-02-14 02:26:33,831 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-14 02:26:33,832 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-14 02:26:33,832 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-14 02:26:33,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-14 02:26:33,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2023-02-14 02:26:33,839 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-14 02:26:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 183 transitions. [2023-02-14 02:26:33,840 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 183 transitions. Word has length 22 [2023-02-14 02:26:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:26:33,841 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 183 transitions. [2023-02-14 02:26:33,841 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-14 02:26:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 183 transitions. [2023-02-14 02:26:33,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 02:26:33,842 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:26:33,842 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-14 02:26:33,851 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 (4)] Ended with exit code 0 [2023-02-14 02:26:34,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:26:34,049 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 02:26:34,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:26:34,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1188560455, now seen corresponding path program 1 times [2023-02-14 02:26:34,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:26:34,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370722841] [2023-02-14 02:26:34,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:26:34,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:26:34,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:26:34,065 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:26:34,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-14 02:26:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:26:34,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 02:26:34,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:26:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:26:34,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:26:34,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:26:34,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370722841] [2023-02-14 02:26:34,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370722841] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:26:34,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:26:34,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:26:34,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956464319] [2023-02-14 02:26:34,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:26:34,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:26:34,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:26:34,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:26:34,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:26:34,195 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-14 02:26:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:26:34,206 INFO L93 Difference]: Finished difference Result 98 states and 184 transitions. [2023-02-14 02:26:34,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:26:34,207 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-14 02:26:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:26:34,207 INFO L225 Difference]: With dead ends: 98 [2023-02-14 02:26:34,208 INFO L226 Difference]: Without dead ends: 98 [2023-02-14 02:26:34,208 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-14 02:26:34,209 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-14 02:26:34,209 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-14 02:26:34,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-14 02:26:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-14 02:26:34,214 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-14 02:26:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 184 transitions. [2023-02-14 02:26:34,215 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 184 transitions. Word has length 22 [2023-02-14 02:26:34,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:26:34,215 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 184 transitions. [2023-02-14 02:26:34,215 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-14 02:26:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 184 transitions. [2023-02-14 02:26:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 02:26:34,216 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:26:34,216 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-14 02:26:34,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-14 02:26:34,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:26:34,423 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 02:26:34,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:26:34,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1112269327, now seen corresponding path program 1 times [2023-02-14 02:26:34,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:26:34,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290753831] [2023-02-14 02:26:34,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:26:34,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:26:34,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:26:34,426 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:26:34,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-14 02:26:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:26:34,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 02:26:34,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:26:34,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:26:34,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:26:34,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:26:34,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290753831] [2023-02-14 02:26:34,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290753831] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:26:34,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:26:34,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:26:34,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369018100] [2023-02-14 02:26:34,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:26:34,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:26:34,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:26:34,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:26:34,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:26:34,487 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-14 02:26:34,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:26:34,497 INFO L93 Difference]: Finished difference Result 137 states and 251 transitions. [2023-02-14 02:26:34,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:26:34,498 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-14 02:26:34,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:26:34,498 INFO L225 Difference]: With dead ends: 137 [2023-02-14 02:26:34,499 INFO L226 Difference]: Without dead ends: 137 [2023-02-14 02:26:34,499 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-14 02:26:34,499 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-14 02:26:34,500 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-14 02:26:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-14 02:26:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-02-14 02:26:34,511 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-14 02:26:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 250 transitions. [2023-02-14 02:26:34,514 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 250 transitions. Word has length 22 [2023-02-14 02:26:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:26:34,519 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 250 transitions. [2023-02-14 02:26:34,519 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-14 02:26:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 250 transitions. [2023-02-14 02:26:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 02:26:34,520 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:26:34,520 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-14 02:26:34,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-14 02:26:34,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:26:34,727 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 02:26:34,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:26:34,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1112262135, now seen corresponding path program 1 times [2023-02-14 02:26:34,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:26:34,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768832845] [2023-02-14 02:26:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:26:34,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:26:34,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:26:34,736 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:26:34,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-14 02:26:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:26:34,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 02:26:34,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:26:34,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:26:34,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:26:34,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:26:34,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768832845] [2023-02-14 02:26:34,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768832845] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:26:34,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:26:34,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:26:34,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028737509] [2023-02-14 02:26:34,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:26:34,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:26:34,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:26:34,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:26:34,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:26:34,791 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-14 02:26:34,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:26:34,800 INFO L93 Difference]: Finished difference Result 135 states and 244 transitions. [2023-02-14 02:26:34,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:26:34,800 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-14 02:26:34,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:26:34,801 INFO L225 Difference]: With dead ends: 135 [2023-02-14 02:26:34,801 INFO L226 Difference]: Without dead ends: 135 [2023-02-14 02:26:34,801 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-14 02:26:34,802 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-14 02:26:34,802 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-14 02:26:34,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-14 02:26:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2023-02-14 02:26:34,808 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-14 02:26:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 243 transitions. [2023-02-14 02:26:34,809 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 243 transitions. Word has length 22 [2023-02-14 02:26:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:26:34,809 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 243 transitions. [2023-02-14 02:26:34,809 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-14 02:26:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 243 transitions. [2023-02-14 02:26:34,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 02:26:34,810 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:26:34,810 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-14 02:26:34,816 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-14 02:26:35,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:26:35,017 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 02:26:35,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:26:35,017 INFO L85 PathProgramCache]: Analyzing trace with hash -476078575, now seen corresponding path program 1 times [2023-02-14 02:26:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:26:35,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032663696] [2023-02-14 02:26:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:26:35,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:26:35,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:26:35,020 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:26:35,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-14 02:26:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 02:26:35,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 02:26:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 02:26:35,140 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-14 02:26:35,143 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 02:26:35,144 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2023-02-14 02:26:35,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2023-02-14 02:26:35,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-14 02:26:35,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:26:35,355 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:26:35,357 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 02:26:35,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 02:26:35 BoogieIcfgContainer [2023-02-14 02:26:35,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 02:26:35,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 02:26:35,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 02:26:35,406 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 02:26:35,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:26:32" (3/4) ... [2023-02-14 02:26:35,412 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-14 02:26:35,412 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 02:26:35,413 INFO L158 Benchmark]: Toolchain (without parser) took 3353.28ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 44.7MB in the beginning and 61.0MB in the end (delta: -16.3MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2023-02-14 02:26:35,413 INFO L158 Benchmark]: CDTParser took 1.56ms. Allocated memory is still 50.3MB. Free memory was 27.7MB in the beginning and 27.6MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 02:26:35,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.59ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 32.3MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-14 02:26:35,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.93ms. Allocated memory is still 67.1MB. Free memory was 32.1MB in the beginning and 30.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 02:26:35,413 INFO L158 Benchmark]: Boogie Preprocessor took 48.91ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 30.2MB in the beginning and 67.2MB in the end (delta: -37.0MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2023-02-14 02:26:35,414 INFO L158 Benchmark]: RCFGBuilder took 385.95ms. Allocated memory is still 88.1MB. Free memory was 67.2MB in the beginning and 50.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-14 02:26:35,414 INFO L158 Benchmark]: TraceAbstraction took 2601.77ms. Allocated memory is still 88.1MB. Free memory was 49.6MB in the beginning and 61.6MB in the end (delta: -11.9MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2023-02-14 02:26:35,414 INFO L158 Benchmark]: Witness Printer took 5.77ms. Allocated memory is still 88.1MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 02:26:35,415 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.56ms. Allocated memory is still 50.3MB. Free memory was 27.7MB in the beginning and 27.6MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.59ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 32.3MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.93ms. Allocated memory is still 67.1MB. Free memory was 32.1MB in the beginning and 30.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.91ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 30.2MB in the beginning and 67.2MB in the end (delta: -37.0MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * RCFGBuilder took 385.95ms. Allocated memory is still 88.1MB. Free memory was 67.2MB in the beginning and 50.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2601.77ms. Allocated memory is still 88.1MB. Free memory was 49.6MB in the beginning and 61.6MB in the end (delta: -11.9MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Witness Printer took 5.77ms. Allocated memory is still 88.1MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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.5s, 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-14 02:26:35,432 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