./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_14-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c 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_14-2.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 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:26:47,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:26:47,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:26:47,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:26:47,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:26:47,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:26:47,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:26:47,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:26:47,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:26:47,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:26:47,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:26:47,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:26:47,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:26:47,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:26:47,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:26:47,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:26:47,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:26:47,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:26:47,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:26:47,888 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:26:47,890 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:26:47,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:26:47,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:26:47,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:26:47,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:26:47,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:26:47,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:26:47,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:26:47,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:26:47,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:26:47,900 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:26:47,900 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:26:47,901 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:26:47,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:26:47,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:26:47,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:26:47,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:26:47,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:26:47,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:26:47,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:26:47,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:26:47,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:26:47,907 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:26:47,931 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:26:47,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:26:47,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:26:47,932 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:26:47,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:26:47,932 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:26:47,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:26:47,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:26:47,933 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:26:47,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:26:47,934 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:26:47,934 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:26:47,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:26:47,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:26:47,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:26:47,935 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:26:47,935 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:26:47,935 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:26:47,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:26:47,936 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:26:47,936 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:26:47,937 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:26:47,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:26:47,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:26:47,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:26:47,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:26:47,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:26:47,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:26:47,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:26:47,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:26:47,938 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2022-07-12 19:26:48,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:26:48,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:26:48,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:26:48,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:26:48,140 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:26:48,141 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-2.c [2022-07-12 19:26:48,185 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/300d9dcec/50cd77d76e484935ae7d89849faf1382/FLAG1f08b98c9 [2022-07-12 19:26:48,577 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:26:48,577 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2022-07-12 19:26:48,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/300d9dcec/50cd77d76e484935ae7d89849faf1382/FLAG1f08b98c9 [2022-07-12 19:26:48,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/300d9dcec/50cd77d76e484935ae7d89849faf1382 [2022-07-12 19:26:48,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:26:48,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:26:48,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:26:48,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:26:48,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:26:48,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:26:48" (1/1) ... [2022-07-12 19:26:48,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7060538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:48, skipping insertion in model container [2022-07-12 19:26:48,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:26:48" (1/1) ... [2022-07-12 19:26:48,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:26:48,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:26:48,828 WARN L230 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_14-2.c[5305,5318] [2022-07-12 19:26:48,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:26:48,845 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:26:48,867 WARN L230 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_14-2.c[5305,5318] [2022-07-12 19:26:48,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:26:48,883 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:26:48,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:48 WrapperNode [2022-07-12 19:26:48,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:26:48,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:26:48,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:26:48,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:26:48,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:48" (1/1) ... [2022-07-12 19:26:48,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:48" (1/1) ... [2022-07-12 19:26:48,921 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 184 [2022-07-12 19:26:48,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:26:48,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:26:48,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:26:48,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:26:48,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:48" (1/1) ... [2022-07-12 19:26:48,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:48" (1/1) ... [2022-07-12 19:26:48,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:48" (1/1) ... [2022-07-12 19:26:48,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:48" (1/1) ... [2022-07-12 19:26:48,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:48" (1/1) ... [2022-07-12 19:26:48,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:48" (1/1) ... [2022-07-12 19:26:48,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:48" (1/1) ... [2022-07-12 19:26:48,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:26:48,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:26:48,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:26:48,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:26:48,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:48" (1/1) ... [2022-07-12 19:26:48,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:26:48,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:26:48,995 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) [2022-07-12 19:26:49,008 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 [2022-07-12 19:26:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:26:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:26:49,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:26:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:26:49,091 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:26:49,092 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:26:49,326 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:26:49,331 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:26:49,331 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 19:26:49,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:26:49 BoogieIcfgContainer [2022-07-12 19:26:49,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:26:49,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:26:49,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:26:49,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:26:49,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:26:48" (1/3) ... [2022-07-12 19:26:49,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5e9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:26:49, skipping insertion in model container [2022-07-12 19:26:49,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:48" (2/3) ... [2022-07-12 19:26:49,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5e9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:26:49, skipping insertion in model container [2022-07-12 19:26:49,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:26:49" (3/3) ... [2022-07-12 19:26:49,341 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2022-07-12 19:26:49,350 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:26:49,350 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 19:26:49,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:26:49,388 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6142afcf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@784188eb [2022-07-12 19:26:49,388 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-12 19:26:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:49,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 19:26:49,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:49,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 19:26:49,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:49,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:49,398 INFO L85 PathProgramCache]: Analyzing trace with hash 28943010, now seen corresponding path program 1 times [2022-07-12 19:26:49,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:49,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162105111] [2022-07-12 19:26:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:49,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:49,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:49,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162105111] [2022-07-12 19:26:49,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162105111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:49,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:49,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:26:49,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649393055] [2022-07-12 19:26:49,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:49,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 19:26:49,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:49,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 19:26:49,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 19:26:49,557 INFO L87 Difference]: Start difference. First operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 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) [2022-07-12 19:26:49,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:49,573 INFO L93 Difference]: Finished difference Result 53 states and 94 transitions. [2022-07-12 19:26:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 19:26:49,575 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 [2022-07-12 19:26:49,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:49,581 INFO L225 Difference]: With dead ends: 53 [2022-07-12 19:26:49,581 INFO L226 Difference]: Without dead ends: 51 [2022-07-12 19:26:49,583 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 [2022-07-12 19:26:49,587 INFO L413 NwaCegarLoop]: 94 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, 94 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 [2022-07-12 19:26:49,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:26:49,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-12 19:26:49,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-12 19:26:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 92 transitions. [2022-07-12 19:26:49,620 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 92 transitions. Word has length 5 [2022-07-12 19:26:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:49,621 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 92 transitions. [2022-07-12 19:26:49,621 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) [2022-07-12 19:26:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2022-07-12 19:26:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:26:49,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:49,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:26:49,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:26:49,622 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash 889700139, now seen corresponding path program 1 times [2022-07-12 19:26:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:49,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364410179] [2022-07-12 19:26:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:49,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:49,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:49,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364410179] [2022-07-12 19:26:49,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364410179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:49,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:49,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:26:49,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826291881] [2022-07-12 19:26:49,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:49,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:49,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:49,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:49,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:49,694 INFO L87 Difference]: Start difference. First operand 51 states and 92 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) [2022-07-12 19:26:49,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:49,717 INFO L93 Difference]: Finished difference Result 50 states and 91 transitions. [2022-07-12 19:26:49,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:49,718 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 [2022-07-12 19:26:49,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:49,720 INFO L225 Difference]: With dead ends: 50 [2022-07-12 19:26:49,720 INFO L226 Difference]: Without dead ends: 48 [2022-07-12 19:26:49,723 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 [2022-07-12 19:26:49,724 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 91 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 [2022-07-12 19:26:49,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 91 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:26:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-12 19:26:49,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-07-12 19:26:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 89 transitions. [2022-07-12 19:26:49,734 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 89 transitions. Word has length 6 [2022-07-12 19:26:49,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:49,735 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 89 transitions. [2022-07-12 19:26:49,735 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) [2022-07-12 19:26:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2022-07-12 19:26:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:26:49,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:49,736 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] [2022-07-12 19:26:49,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:26:49,737 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:49,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash 792943379, now seen corresponding path program 1 times [2022-07-12 19:26:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:49,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206152133] [2022-07-12 19:26:49,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:49,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:49,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206152133] [2022-07-12 19:26:49,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206152133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:49,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:49,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:49,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806537630] [2022-07-12 19:26:49,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:49,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:49,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:49,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:49,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:49,832 INFO L87 Difference]: Start difference. First operand 48 states and 89 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:49,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:49,855 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2022-07-12 19:26:49,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:49,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 19:26:49,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:49,859 INFO L225 Difference]: With dead ends: 93 [2022-07-12 19:26:49,860 INFO L226 Difference]: Without dead ends: 93 [2022-07-12 19:26:49,860 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 [2022-07-12 19:26:49,862 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:49,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:26:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-12 19:26:49,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2022-07-12 19:26:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 118 transitions. [2022-07-12 19:26:49,873 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 118 transitions. Word has length 21 [2022-07-12 19:26:49,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:49,873 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 118 transitions. [2022-07-12 19:26:49,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 118 transitions. [2022-07-12 19:26:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:26:49,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:49,875 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] [2022-07-12 19:26:49,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:26:49,875 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:49,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:49,876 INFO L85 PathProgramCache]: Analyzing trace with hash 792950571, now seen corresponding path program 1 times [2022-07-12 19:26:49,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:49,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761780678] [2022-07-12 19:26:49,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:49,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:49,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:49,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:49,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761780678] [2022-07-12 19:26:49,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761780678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:49,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:49,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:49,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357763232] [2022-07-12 19:26:49,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:49,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:49,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:49,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:49,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:49,932 INFO L87 Difference]: Start difference. First operand 63 states and 118 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:49,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:49,946 INFO L93 Difference]: Finished difference Result 94 states and 173 transitions. [2022-07-12 19:26:49,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:49,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 19:26:49,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:49,947 INFO L225 Difference]: With dead ends: 94 [2022-07-12 19:26:49,947 INFO L226 Difference]: Without dead ends: 94 [2022-07-12 19:26:49,948 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 [2022-07-12 19:26:49,949 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 71 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 224 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 [2022-07-12 19:26:49,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:26:49,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-12 19:26:49,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-07-12 19:26:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 172 transitions. [2022-07-12 19:26:49,964 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 172 transitions. Word has length 21 [2022-07-12 19:26:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:49,964 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 172 transitions. [2022-07-12 19:26:49,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 172 transitions. [2022-07-12 19:26:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:26:49,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:49,964 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] [2022-07-12 19:26:49,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:26:49,965 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:49,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:49,965 INFO L85 PathProgramCache]: Analyzing trace with hash -795404523, now seen corresponding path program 1 times [2022-07-12 19:26:49,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:49,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846846382] [2022-07-12 19:26:49,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:49,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:49,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:49,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846846382] [2022-07-12 19:26:49,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846846382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:49,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:49,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:49,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501541302] [2022-07-12 19:26:49,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:49,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:49,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:50,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:50,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:50,000 INFO L87 Difference]: Start difference. First operand 92 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:50,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:50,016 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2022-07-12 19:26:50,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:50,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 19:26:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:50,019 INFO L225 Difference]: With dead ends: 96 [2022-07-12 19:26:50,019 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 19:26:50,020 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 [2022-07-12 19:26:50,021 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 69 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 198 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 [2022-07-12 19:26:50,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 198 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:26:50,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 19:26:50,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-07-12 19:26:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 172 transitions. [2022-07-12 19:26:50,032 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 172 transitions. Word has length 21 [2022-07-12 19:26:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:50,032 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 172 transitions. [2022-07-12 19:26:50,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2022-07-12 19:26:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:26:50,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:50,033 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] [2022-07-12 19:26:50,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:26:50,033 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:50,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:50,034 INFO L85 PathProgramCache]: Analyzing trace with hash -795397331, now seen corresponding path program 1 times [2022-07-12 19:26:50,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:50,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657255185] [2022-07-12 19:26:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:50,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:50,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:26:50,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657255185] [2022-07-12 19:26:50,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657255185] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:50,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:50,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:50,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359717306] [2022-07-12 19:26:50,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:50,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:50,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:26:50,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:50,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:50,064 INFO L87 Difference]: Start difference. First operand 94 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:50,076 INFO L93 Difference]: Finished difference Result 127 states and 228 transitions. [2022-07-12 19:26:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:50,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 19:26:50,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:50,078 INFO L225 Difference]: With dead ends: 127 [2022-07-12 19:26:50,078 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 19:26:50,078 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 [2022-07-12 19:26:50,079 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 70 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 125 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 [2022-07-12 19:26:50,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 125 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:26:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 19:26:50,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-07-12 19:26:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:50,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 227 transitions. [2022-07-12 19:26:50,083 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 227 transitions. Word has length 21 [2022-07-12 19:26:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:50,083 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 227 transitions. [2022-07-12 19:26:50,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 227 transitions. [2022-07-12 19:26:50,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:26:50,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:50,084 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] [2022-07-12 19:26:50,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 19:26:50,084 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:50,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:50,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1816465685, now seen corresponding path program 1 times [2022-07-12 19:26:50,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:26:50,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317572032] [2022-07-12 19:26:50,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:26:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 19:26:50,094 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 19:26:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 19:26:50,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 19:26:50,115 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 19:26:50,115 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-07-12 19:26:50,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-07-12 19:26:50,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 19:26:50,121 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:26:50,123 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 19:26:50,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 07:26:50 BoogieIcfgContainer [2022-07-12 19:26:50,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 19:26:50,165 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 19:26:50,165 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 19:26:50,165 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 19:26:50,166 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:26:49" (3/4) ... [2022-07-12 19:26:50,167 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 19:26:50,167 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 19:26:50,168 INFO L158 Benchmark]: Toolchain (without parser) took 1560.18ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 72.1MB in the beginning and 67.7MB in the end (delta: 4.5MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2022-07-12 19:26:50,168 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:26:50,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.64ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 72.1MB in the beginning and 101.2MB in the end (delta: -29.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 19:26:50,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.09ms. Allocated memory is still 127.9MB. Free memory was 101.2MB in the beginning and 99.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:26:50,170 INFO L158 Benchmark]: Boogie Preprocessor took 38.35ms. Allocated memory is still 127.9MB. Free memory was 99.2MB in the beginning and 98.3MB in the end (delta: 928.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:26:50,170 INFO L158 Benchmark]: RCFGBuilder took 372.01ms. Allocated memory is still 127.9MB. Free memory was 98.0MB in the beginning and 82.9MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 19:26:50,170 INFO L158 Benchmark]: TraceAbstraction took 830.30ms. Allocated memory is still 127.9MB. Free memory was 82.4MB in the beginning and 68.3MB in the end (delta: 14.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2022-07-12 19:26:50,170 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 127.9MB. Free memory was 68.3MB in the beginning and 67.7MB in the end (delta: 655.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:26:50,171 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.64ms. Allocated memory was 100.7MB in the beginning and 127.9MB in the end (delta: 27.3MB). Free memory was 72.1MB in the beginning and 101.2MB in the end (delta: -29.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.09ms. Allocated memory is still 127.9MB. Free memory was 101.2MB in the beginning and 99.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.35ms. Allocated memory is still 127.9MB. Free memory was 99.2MB in the beginning and 98.3MB in the end (delta: 928.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 372.01ms. Allocated memory is still 127.9MB. Free memory was 98.0MB in the beginning and 82.9MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 830.30ms. Allocated memory is still 127.9MB. Free memory was 82.4MB in the beginning and 68.3MB in the end (delta: 14.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 127.9MB. Free memory was 68.3MB in the beginning and 67.7MB in the end (delta: 655.0kB). 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: 219]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 219. 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; [L51] int cond; VAL [p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L88] COND FALSE !(p1 != 0) VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L92] COND FALSE !(p2 != 0) VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L96] COND FALSE !(p3 != 0) VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L108] COND TRUE p6 != 0 [L109] lk6 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L120] COND TRUE p9 != 0 [L121] lk9 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L124] COND TRUE p10 != 0 [L125] lk10 = 1 VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L128] COND FALSE !(p11 != 0) VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L140] COND TRUE p14 != 0 [L141] lk14 = 1 VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L146] COND FALSE !(p1 != 0) VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L151] COND FALSE !(p2 != 0) VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L219] reach_error() VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, 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, 53 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 906 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 624 mSDtfsCounter, 22 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=125occurred in iteration=6, 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, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 239 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 [2022-07-12 19:26:50,195 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_14-2.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 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:26:51,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:26:51,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:26:51,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:26:51,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:26:51,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:26:51,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:26:51,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:26:51,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:26:51,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:26:51,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:26:51,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:26:51,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:26:51,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:26:51,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:26:51,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:26:51,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:26:51,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:26:51,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:26:51,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:26:51,922 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:26:51,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:26:51,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:26:51,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:26:51,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:26:51,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:26:51,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:26:51,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:26:51,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:26:51,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:26:51,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:26:51,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:26:51,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:26:51,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:26:51,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:26:51,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:26:51,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:26:51,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:26:51,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:26:51,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:26:51,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:26:51,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:26:51,942 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 19:26:51,965 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:26:51,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:26:51,966 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:26:51,966 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:26:51,966 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:26:51,967 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:26:51,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:26:51,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:26:51,967 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:26:51,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:26:51,968 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:26:51,968 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:26:51,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:26:51,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:26:51,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:26:51,973 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:26:51,974 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:26:51,974 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:26:51,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:26:51,974 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:26:51,974 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 19:26:51,974 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 19:26:51,975 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:26:51,975 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:26:51,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:26:51,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:26:51,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:26:51,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:26:51,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:26:51,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:26:51,976 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 19:26:51,976 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 19:26:51,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 19:26:51,976 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2022-07-12 19:26:52,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:26:52,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:26:52,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:26:52,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:26:52,260 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:26:52,261 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-2.c [2022-07-12 19:26:52,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782088b0e/2c485ffa4a4f4b948aa55e079c197916/FLAG3de8d521a [2022-07-12 19:26:52,658 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:26:52,659 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2022-07-12 19:26:52,666 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782088b0e/2c485ffa4a4f4b948aa55e079c197916/FLAG3de8d521a [2022-07-12 19:26:52,679 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782088b0e/2c485ffa4a4f4b948aa55e079c197916 [2022-07-12 19:26:52,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:26:52,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:26:52,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:26:52,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:26:52,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:26:52,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:26:52" (1/1) ... [2022-07-12 19:26:52,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cb24cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:52, skipping insertion in model container [2022-07-12 19:26:52,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:26:52" (1/1) ... [2022-07-12 19:26:52,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:26:52,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:26:52,857 WARN L230 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_14-2.c[5305,5318] [2022-07-12 19:26:52,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:26:52,901 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:26:52,935 WARN L230 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_14-2.c[5305,5318] [2022-07-12 19:26:52,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:26:52,950 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:26:52,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:52 WrapperNode [2022-07-12 19:26:52,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:26:52,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:26:52,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:26:52,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:26:52,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:52" (1/1) ... [2022-07-12 19:26:52,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:52" (1/1) ... [2022-07-12 19:26:52,997 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 169 [2022-07-12 19:26:52,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:26:52,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:26:52,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:26:52,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:26:53,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:52" (1/1) ... [2022-07-12 19:26:53,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:52" (1/1) ... [2022-07-12 19:26:53,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:52" (1/1) ... [2022-07-12 19:26:53,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:52" (1/1) ... [2022-07-12 19:26:53,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:52" (1/1) ... [2022-07-12 19:26:53,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:52" (1/1) ... [2022-07-12 19:26:53,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:52" (1/1) ... [2022-07-12 19:26:53,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:26:53,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:26:53,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:26:53,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:26:53,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:52" (1/1) ... [2022-07-12 19:26:53,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:26:53,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:26:53,066 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) [2022-07-12 19:26:53,082 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 [2022-07-12 19:26:53,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:26:53,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:26:53,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:26:53,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 19:26:53,164 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:26:53,165 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:26:53,324 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:26:53,328 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:26:53,328 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 19:26:53,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:26:53 BoogieIcfgContainer [2022-07-12 19:26:53,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:26:53,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:26:53,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:26:53,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:26:53,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:26:52" (1/3) ... [2022-07-12 19:26:53,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658dddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:26:53, skipping insertion in model container [2022-07-12 19:26:53,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:26:52" (2/3) ... [2022-07-12 19:26:53,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658dddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:26:53, skipping insertion in model container [2022-07-12 19:26:53,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:26:53" (3/3) ... [2022-07-12 19:26:53,338 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2022-07-12 19:26:53,348 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:26:53,354 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 19:26:53,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:26:53,411 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@55eb0af8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23b14cc6 [2022-07-12 19:26:53,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-12 19:26:53,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:53,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 19:26:53,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:53,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 19:26:53,418 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:53,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:53,422 INFO L85 PathProgramCache]: Analyzing trace with hash 28943010, now seen corresponding path program 1 times [2022-07-12 19:26:53,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:53,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469259377] [2022-07-12 19:26:53,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:53,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:53,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:53,432 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:26:53,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 19:26:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:53,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 19:26:53,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:53,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:53,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:53,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:53,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469259377] [2022-07-12 19:26:53,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469259377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:53,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:53,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:26:53,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124851302] [2022-07-12 19:26:53,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:53,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 19:26:53,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:53,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 19:26:53,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 19:26:53,532 INFO L87 Difference]: Start difference. First operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 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) [2022-07-12 19:26:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:53,544 INFO L93 Difference]: Finished difference Result 53 states and 94 transitions. [2022-07-12 19:26:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 19:26:53,545 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 [2022-07-12 19:26:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:53,551 INFO L225 Difference]: With dead ends: 53 [2022-07-12 19:26:53,551 INFO L226 Difference]: Without dead ends: 51 [2022-07-12 19:26:53,553 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 [2022-07-12 19:26:53,556 INFO L413 NwaCegarLoop]: 94 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, 94 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 [2022-07-12 19:26:53,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:26:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-12 19:26:53,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-12 19:26:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 92 transitions. [2022-07-12 19:26:53,592 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 92 transitions. Word has length 5 [2022-07-12 19:26:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:53,592 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 92 transitions. [2022-07-12 19:26:53,592 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) [2022-07-12 19:26:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2022-07-12 19:26:53,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:26:53,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:53,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:26:53,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-12 19:26:53,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:26:53,799 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:53,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:53,800 INFO L85 PathProgramCache]: Analyzing trace with hash 889700139, now seen corresponding path program 1 times [2022-07-12 19:26:53,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:53,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530235552] [2022-07-12 19:26:53,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:53,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:53,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:53,802 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:26:53,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 19:26:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:53,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:26:53,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:53,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:53,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:53,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530235552] [2022-07-12 19:26:53,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530235552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:53,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:53,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:26:53,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447939779] [2022-07-12 19:26:53,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:53,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:53,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:53,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:53,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:53,859 INFO L87 Difference]: Start difference. First operand 51 states and 92 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) [2022-07-12 19:26:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:53,867 INFO L93 Difference]: Finished difference Result 50 states and 91 transitions. [2022-07-12 19:26:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:53,868 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 [2022-07-12 19:26:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:53,869 INFO L225 Difference]: With dead ends: 50 [2022-07-12 19:26:53,869 INFO L226 Difference]: Without dead ends: 48 [2022-07-12 19:26:53,869 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 [2022-07-12 19:26:53,870 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 91 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 [2022-07-12 19:26:53,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 91 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:26:53,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-12 19:26:53,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-07-12 19:26:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 89 transitions. [2022-07-12 19:26:53,877 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 89 transitions. Word has length 6 [2022-07-12 19:26:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:53,878 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 89 transitions. [2022-07-12 19:26:53,878 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) [2022-07-12 19:26:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2022-07-12 19:26:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:26:53,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:53,879 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] [2022-07-12 19:26:53,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:26:54,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:26:54,084 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:54,086 INFO L85 PathProgramCache]: Analyzing trace with hash 792943379, now seen corresponding path program 1 times [2022-07-12 19:26:54,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:54,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526464189] [2022-07-12 19:26:54,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:54,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:54,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:54,090 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:26:54,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 19:26:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:54,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:26:54,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:54,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:54,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:54,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526464189] [2022-07-12 19:26:54,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526464189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:54,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:54,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:54,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967262449] [2022-07-12 19:26:54,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:54,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:54,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:54,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:54,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:54,181 INFO L87 Difference]: Start difference. First operand 48 states and 89 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:54,202 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2022-07-12 19:26:54,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:54,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 19:26:54,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:54,204 INFO L225 Difference]: With dead ends: 93 [2022-07-12 19:26:54,204 INFO L226 Difference]: Without dead ends: 93 [2022-07-12 19:26:54,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:54,205 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:26:54,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:26:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-12 19:26:54,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2022-07-12 19:26:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 118 transitions. [2022-07-12 19:26:54,213 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 118 transitions. Word has length 21 [2022-07-12 19:26:54,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:54,213 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 118 transitions. [2022-07-12 19:26:54,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:54,214 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 118 transitions. [2022-07-12 19:26:54,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:26:54,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:54,215 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] [2022-07-12 19:26:54,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:26:54,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:26:54,416 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:54,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:54,416 INFO L85 PathProgramCache]: Analyzing trace with hash 792950571, now seen corresponding path program 1 times [2022-07-12 19:26:54,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:54,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626441987] [2022-07-12 19:26:54,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:54,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:54,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:54,418 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:26:54,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 19:26:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:54,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:26:54,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:54,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:54,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:54,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626441987] [2022-07-12 19:26:54,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626441987] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:54,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:54,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:54,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846049407] [2022-07-12 19:26:54,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:54,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:54,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:54,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:54,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:54,499 INFO L87 Difference]: Start difference. First operand 63 states and 118 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:54,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:54,526 INFO L93 Difference]: Finished difference Result 94 states and 173 transitions. [2022-07-12 19:26:54,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:54,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 19:26:54,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:54,527 INFO L225 Difference]: With dead ends: 94 [2022-07-12 19:26:54,527 INFO L226 Difference]: Without dead ends: 94 [2022-07-12 19:26:54,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:54,528 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 71 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 224 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 [2022-07-12 19:26:54,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:26:54,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-12 19:26:54,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-07-12 19:26:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 172 transitions. [2022-07-12 19:26:54,535 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 172 transitions. Word has length 21 [2022-07-12 19:26:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:54,536 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 172 transitions. [2022-07-12 19:26:54,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 172 transitions. [2022-07-12 19:26:54,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:26:54,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:54,536 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] [2022-07-12 19:26:54,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 19:26:54,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:26:54,743 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:54,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:54,743 INFO L85 PathProgramCache]: Analyzing trace with hash -795404523, now seen corresponding path program 1 times [2022-07-12 19:26:54,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:54,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535093318] [2022-07-12 19:26:54,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:54,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:54,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:54,745 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:26:54,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 19:26:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:54,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:26:54,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:54,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:54,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:54,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535093318] [2022-07-12 19:26:54,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535093318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:54,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:54,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:54,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421936896] [2022-07-12 19:26:54,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:54,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:54,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:54,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:54,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:54,799 INFO L87 Difference]: Start difference. First operand 92 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:54,808 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2022-07-12 19:26:54,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:54,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 19:26:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:54,809 INFO L225 Difference]: With dead ends: 96 [2022-07-12 19:26:54,809 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 19:26:54,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:54,810 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 69 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 198 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 [2022-07-12 19:26:54,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 198 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:26:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 19:26:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-07-12 19:26:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 172 transitions. [2022-07-12 19:26:54,818 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 172 transitions. Word has length 21 [2022-07-12 19:26:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:54,818 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 172 transitions. [2022-07-12 19:26:54,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2022-07-12 19:26:54,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:26:54,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:54,819 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] [2022-07-12 19:26:54,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-12 19:26:55,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:26:55,025 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:55,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash -795397331, now seen corresponding path program 1 times [2022-07-12 19:26:55,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:55,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979215957] [2022-07-12 19:26:55,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:55,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:55,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:55,027 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:26:55,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 19:26:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:26:55,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:26:55,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:26:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:26:55,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:26:55,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:26:55,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979215957] [2022-07-12 19:26:55,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979215957] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:26:55,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:26:55,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:26:55,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133153098] [2022-07-12 19:26:55,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:26:55,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:26:55,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:26:55,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:26:55,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:55,107 INFO L87 Difference]: Start difference. First operand 94 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:55,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:26:55,116 INFO L93 Difference]: Finished difference Result 127 states and 228 transitions. [2022-07-12 19:26:55,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:26:55,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 19:26:55,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:26:55,117 INFO L225 Difference]: With dead ends: 127 [2022-07-12 19:26:55,117 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 19:26:55,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:26:55,118 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 70 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 125 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 [2022-07-12 19:26:55,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 125 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:26:55,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 19:26:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-07-12 19:26:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 227 transitions. [2022-07-12 19:26:55,124 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 227 transitions. Word has length 21 [2022-07-12 19:26:55,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:26:55,125 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 227 transitions. [2022-07-12 19:26:55,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:26:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 227 transitions. [2022-07-12 19:26:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:26:55,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:26:55,126 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] [2022-07-12 19:26:55,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 19:26:55,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:26:55,337 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-12 19:26:55,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:26:55,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1816465685, now seen corresponding path program 1 times [2022-07-12 19:26:55,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:26:55,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258478094] [2022-07-12 19:26:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:26:55,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:26:55,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:26:55,339 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:26:55,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 19:26:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 19:26:55,366 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 19:26:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 19:26:55,406 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-12 19:26:55,406 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 19:26:55,407 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-07-12 19:26:55,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-07-12 19:26:55,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-12 19:26:55,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:26:55,617 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:26:55,619 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 19:26:55,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 07:26:55 BoogieIcfgContainer [2022-07-12 19:26:55,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 19:26:55,650 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 19:26:55,650 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 19:26:55,650 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 19:26:55,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:26:53" (3/4) ... [2022-07-12 19:26:55,652 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 19:26:55,652 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 19:26:55,653 INFO L158 Benchmark]: Toolchain (without parser) took 2971.16ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 33.4MB in the beginning and 42.7MB in the end (delta: -9.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:26:55,653 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 54.5MB. Free memory was 36.6MB in the beginning and 36.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:26:55,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.08ms. Allocated memory is still 54.5MB. Free memory was 33.3MB in the beginning and 36.6MB in the end (delta: -3.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 19:26:55,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.50ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 34.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:26:55,653 INFO L158 Benchmark]: Boogie Preprocessor took 40.60ms. Allocated memory is still 54.5MB. Free memory was 34.6MB in the beginning and 33.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:26:55,654 INFO L158 Benchmark]: RCFGBuilder took 293.81ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 33.1MB in the beginning and 45.9MB in the end (delta: -12.8MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2022-07-12 19:26:55,654 INFO L158 Benchmark]: TraceAbstraction took 2315.52ms. Allocated memory is still 67.1MB. Free memory was 45.1MB in the beginning and 43.1MB in the end (delta: 2.0MB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. [2022-07-12 19:26:55,654 INFO L158 Benchmark]: Witness Printer took 2.39ms. Allocated memory is still 67.1MB. Free memory was 43.1MB in the beginning and 42.7MB in the end (delta: 424.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:26:55,655 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.38ms. Allocated memory is still 54.5MB. Free memory was 36.6MB in the beginning and 36.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.08ms. Allocated memory is still 54.5MB. Free memory was 33.3MB in the beginning and 36.6MB in the end (delta: -3.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.50ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 34.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.60ms. Allocated memory is still 54.5MB. Free memory was 34.6MB in the beginning and 33.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 293.81ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 33.1MB in the beginning and 45.9MB in the end (delta: -12.8MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2315.52ms. Allocated memory is still 67.1MB. Free memory was 45.1MB in the beginning and 43.1MB in the end (delta: 2.0MB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. * Witness Printer took 2.39ms. Allocated memory is still 67.1MB. Free memory was 43.1MB in the beginning and 42.7MB in the end (delta: 424.8kB). 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: 219]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 219. 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; [L51] int cond; [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0] [L88] COND FALSE !(p1 != 0) VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0] [L92] COND FALSE !(p2 != 0) VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0] [L96] COND FALSE !(p3 != 0) VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L108] COND TRUE p6 != 0 [L109] lk6 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L120] COND TRUE p9 != 0 [L121] lk9 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L124] COND TRUE p10 != 0 [L125] lk10 = 1 VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=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] [L128] COND FALSE !(p11 != 0) VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=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] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=0, lk14=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] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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] [L140] COND TRUE p14 != 0 [L141] lk14 = 1 VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L146] COND FALSE !(p1 != 0) VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L151] COND FALSE !(p2 != 0) VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L219] reach_error() VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, 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, 53 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 906 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 624 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=6, 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, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 275 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 [2022-07-12 19:26:55,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample