./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec 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_8.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 37d0ed05d77a0379c9ed98058bf2f327252773ce ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 07:51:22,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 07:51:22,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 07:51:22,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 07:51:22,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 07:51:22,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 07:51:22,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 07:51:22,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 07:51:22,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 07:51:22,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 07:51:22,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 07:51:22,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 07:51:22,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 07:51:22,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 07:51:22,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 07:51:22,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 07:51:22,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 07:51:22,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 07:51:22,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 07:51:22,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 07:51:22,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 07:51:22,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 07:51:22,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 07:51:22,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 07:51:22,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 07:51:22,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 07:51:22,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 07:51:22,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 07:51:22,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 07:51:22,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 07:51:22,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 07:51:22,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 07:51:22,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 07:51:22,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 07:51:22,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 07:51:22,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 07:51:22,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 07:51:22,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 07:51:22,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 07:51:22,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 07:51:22,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 07:51:22,979 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 07:51:23,004 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 07:51:23,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 07:51:23,005 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 07:51:23,005 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 07:51:23,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 07:51:23,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 07:51:23,007 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 07:51:23,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 07:51:23,007 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 07:51:23,007 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 07:51:23,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 07:51:23,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 07:51:23,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 07:51:23,009 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 07:51:23,009 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 07:51:23,009 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 07:51:23,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 07:51:23,009 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 07:51:23,009 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 07:51:23,009 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 07:51:23,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 07:51:23,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 07:51:23,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 07:51:23,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:51:23,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 07:51:23,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 07:51:23,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 07:51:23,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 07:51:23,011 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 07:51:23,011 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 -> 37d0ed05d77a0379c9ed98058bf2f327252773ce [2021-08-27 07:51:23,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 07:51:23,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 07:51:23,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 07:51:23,273 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 07:51:23,273 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 07:51:23,274 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2021-08-27 07:51:23,346 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17aedf36/7a43bf2c1184470cb7aaea188fe0c4c7/FLAGdd9687d57 [2021-08-27 07:51:23,713 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 07:51:23,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2021-08-27 07:51:23,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17aedf36/7a43bf2c1184470cb7aaea188fe0c4c7/FLAGdd9687d57 [2021-08-27 07:51:23,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17aedf36/7a43bf2c1184470cb7aaea188fe0c4c7 [2021-08-27 07:51:23,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 07:51:23,738 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 07:51:23,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 07:51:23,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 07:51:23,743 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 07:51:23,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:51:23" (1/1) ... [2021-08-27 07:51:23,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9572e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:23, skipping insertion in model container [2021-08-27 07:51:23,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:51:23" (1/1) ... [2021-08-27 07:51:23,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 07:51:23,764 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 07:51:23,866 WARN L228 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_8.c[3218,3231] [2021-08-27 07:51:23,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:51:23,873 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 07:51:23,925 WARN L228 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_8.c[3218,3231] [2021-08-27 07:51:23,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:51:23,940 INFO L208 MainTranslator]: Completed translation [2021-08-27 07:51:23,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:23 WrapperNode [2021-08-27 07:51:23,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 07:51:23,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 07:51:23,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 07:51:23,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 07:51:23,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:23" (1/1) ... [2021-08-27 07:51:23,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:23" (1/1) ... [2021-08-27 07:51:23,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:23" (1/1) ... [2021-08-27 07:51:23,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:23" (1/1) ... [2021-08-27 07:51:23,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:23" (1/1) ... [2021-08-27 07:51:23,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:23" (1/1) ... [2021-08-27 07:51:23,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:23" (1/1) ... [2021-08-27 07:51:23,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 07:51:23,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 07:51:23,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 07:51:23,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 07:51:23,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:23" (1/1) ... [2021-08-27 07:51:23,973 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:51:23,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:51:23,990 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) [2021-08-27 07:51:24,007 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 [2021-08-27 07:51:24,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 07:51:24,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 07:51:24,018 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 07:51:24,018 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 07:51:24,018 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 07:51:24,018 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 07:51:24,018 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 07:51:24,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 07:51:24,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 07:51:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 07:51:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 07:51:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 07:51:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 07:51:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 07:51:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 07:51:24,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 07:51:24,201 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 07:51:24,201 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-08-27 07:51:24,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:51:24 BoogieIcfgContainer [2021-08-27 07:51:24,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 07:51:24,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 07:51:24,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 07:51:24,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 07:51:24,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 07:51:23" (1/3) ... [2021-08-27 07:51:24,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bd5adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:51:24, skipping insertion in model container [2021-08-27 07:51:24,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:23" (2/3) ... [2021-08-27 07:51:24,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bd5adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:51:24, skipping insertion in model container [2021-08-27 07:51:24,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:51:24" (3/3) ... [2021-08-27 07:51:24,208 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2021-08-27 07:51:24,211 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 07:51:24,211 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-27 07:51:24,235 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 07:51:24,239 INFO L339 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, mConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 07:51:24,240 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-27 07:51:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 33 states have (on average 1.878787878787879) internal successors, (62), 35 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 07:51:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 07:51:24,254 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:24,254 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:24,255 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr1ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:24,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:24,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1386566926, now seen corresponding path program 1 times [2021-08-27 07:51:24,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:24,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216859378] [2021-08-27 07:51:24,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:24,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:24,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:24,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:24,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216859378] [2021-08-27 07:51:24,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216859378] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:24,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:24,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 07:51:24,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411032829] [2021-08-27 07:51:24,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 07:51:24,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:24,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 07:51:24,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:51:24,409 INFO L87 Difference]: Start difference. First operand has 40 states, 33 states have (on average 1.878787878787879) internal successors, (62), 35 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:24,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:24,431 INFO L93 Difference]: Finished difference Result 39 states and 62 transitions. [2021-08-27 07:51:24,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:51:24,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 07:51:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:24,437 INFO L225 Difference]: With dead ends: 39 [2021-08-27 07:51:24,437 INFO L226 Difference]: Without dead ends: 34 [2021-08-27 07:51:24,438 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:51:24,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-08-27 07:51:24,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-08-27 07:51:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2021-08-27 07:51:24,468 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 9 [2021-08-27 07:51:24,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:24,468 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2021-08-27 07:51:24,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2021-08-27 07:51:24,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 07:51:24,469 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:24,469 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:24,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 07:51:24,470 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:24,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:24,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1109709376, now seen corresponding path program 1 times [2021-08-27 07:51:24,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:24,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694441467] [2021-08-27 07:51:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:24,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:24,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:24,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:24,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694441467] [2021-08-27 07:51:24,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694441467] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:24,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:24,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:24,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850059225] [2021-08-27 07:51:24,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:24,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:24,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:24,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:24,538 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:24,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:24,637 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2021-08-27 07:51:24,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:24,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 07:51:24,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:24,639 INFO L225 Difference]: With dead ends: 61 [2021-08-27 07:51:24,639 INFO L226 Difference]: Without dead ends: 61 [2021-08-27 07:51:24,639 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-27 07:51:24,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2021-08-27 07:51:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2021-08-27 07:51:24,644 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2021-08-27 07:51:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:24,645 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2021-08-27 07:51:24,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2021-08-27 07:51:24,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 07:51:24,645 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:24,646 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:24,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 07:51:24,646 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:24,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:24,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1810773954, now seen corresponding path program 1 times [2021-08-27 07:51:24,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:24,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351075616] [2021-08-27 07:51:24,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:24,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:24,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:24,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:24,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351075616] [2021-08-27 07:51:24,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351075616] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:24,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:24,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:24,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138561433] [2021-08-27 07:51:24,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:24,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:24,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:24,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:24,719 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:24,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:24,811 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2021-08-27 07:51:24,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:24,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 07:51:24,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:24,813 INFO L225 Difference]: With dead ends: 61 [2021-08-27 07:51:24,813 INFO L226 Difference]: Without dead ends: 61 [2021-08-27 07:51:24,813 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:24,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-27 07:51:24,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2021-08-27 07:51:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 102 transitions. [2021-08-27 07:51:24,818 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 102 transitions. Word has length 19 [2021-08-27 07:51:24,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:24,818 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 102 transitions. [2021-08-27 07:51:24,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:24,819 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 102 transitions. [2021-08-27 07:51:24,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 07:51:24,819 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:24,819 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:24,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 07:51:24,820 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:24,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:24,820 INFO L82 PathProgramCache]: Analyzing trace with hash 41466319, now seen corresponding path program 1 times [2021-08-27 07:51:24,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:24,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87783060] [2021-08-27 07:51:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:24,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:24,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:24,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:24,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87783060] [2021-08-27 07:51:24,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87783060] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:24,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:24,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:24,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425277363] [2021-08-27 07:51:24,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:24,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:24,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:24,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:24,870 INFO L87 Difference]: Start difference. First operand 59 states and 102 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:24,960 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2021-08-27 07:51:24,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:24,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 07:51:24,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:24,962 INFO L225 Difference]: With dead ends: 64 [2021-08-27 07:51:24,962 INFO L226 Difference]: Without dead ends: 64 [2021-08-27 07:51:24,962 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:24,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-08-27 07:51:24,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2021-08-27 07:51:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2021-08-27 07:51:24,966 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 20 [2021-08-27 07:51:24,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:24,967 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2021-08-27 07:51:24,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2021-08-27 07:51:24,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 07:51:24,967 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:24,968 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:24,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 07:51:24,968 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:24,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:24,969 INFO L82 PathProgramCache]: Analyzing trace with hash 299631757, now seen corresponding path program 1 times [2021-08-27 07:51:24,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:24,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720572182] [2021-08-27 07:51:24,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:24,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:25,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:25,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720572182] [2021-08-27 07:51:25,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720572182] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:25,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:25,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:25,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49799663] [2021-08-27 07:51:25,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:25,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:25,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:25,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:25,014 INFO L87 Difference]: Start difference. First operand 62 states and 104 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:25,093 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2021-08-27 07:51:25,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:25,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 07:51:25,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:25,095 INFO L225 Difference]: With dead ends: 113 [2021-08-27 07:51:25,095 INFO L226 Difference]: Without dead ends: 113 [2021-08-27 07:51:25,095 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:25,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-08-27 07:51:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2021-08-27 07:51:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 189 transitions. [2021-08-27 07:51:25,109 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 189 transitions. Word has length 20 [2021-08-27 07:51:25,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:25,109 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 189 transitions. [2021-08-27 07:51:25,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 189 transitions. [2021-08-27 07:51:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 07:51:25,110 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:25,110 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:25,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 07:51:25,111 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:25,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:25,111 INFO L82 PathProgramCache]: Analyzing trace with hash -401432821, now seen corresponding path program 1 times [2021-08-27 07:51:25,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:25,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646295547] [2021-08-27 07:51:25,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:25,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:25,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:25,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646295547] [2021-08-27 07:51:25,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646295547] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:25,152 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:25,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:25,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210765101] [2021-08-27 07:51:25,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:25,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:25,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:25,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:25,154 INFO L87 Difference]: Start difference. First operand 111 states and 189 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:25,233 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2021-08-27 07:51:25,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:25,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 07:51:25,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:25,234 INFO L225 Difference]: With dead ends: 141 [2021-08-27 07:51:25,234 INFO L226 Difference]: Without dead ends: 141 [2021-08-27 07:51:25,234 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:25,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-08-27 07:51:25,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 111. [2021-08-27 07:51:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 187 transitions. [2021-08-27 07:51:25,239 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 187 transitions. Word has length 20 [2021-08-27 07:51:25,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:25,239 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 187 transitions. [2021-08-27 07:51:25,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 187 transitions. [2021-08-27 07:51:25,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 07:51:25,240 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:25,241 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:25,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 07:51:25,241 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:25,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:25,242 INFO L82 PathProgramCache]: Analyzing trace with hash 698864247, now seen corresponding path program 1 times [2021-08-27 07:51:25,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:25,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919545692] [2021-08-27 07:51:25,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:25,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:25,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:25,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919545692] [2021-08-27 07:51:25,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919545692] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:25,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:25,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:25,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328023388] [2021-08-27 07:51:25,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:25,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:25,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:25,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:25,282 INFO L87 Difference]: Start difference. First operand 111 states and 187 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:25,362 INFO L93 Difference]: Finished difference Result 201 states and 342 transitions. [2021-08-27 07:51:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:25,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 07:51:25,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:25,363 INFO L225 Difference]: With dead ends: 201 [2021-08-27 07:51:25,363 INFO L226 Difference]: Without dead ends: 201 [2021-08-27 07:51:25,364 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-08-27 07:51:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 151. [2021-08-27 07:51:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 253 transitions. [2021-08-27 07:51:25,369 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 253 transitions. Word has length 21 [2021-08-27 07:51:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:25,369 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 253 transitions. [2021-08-27 07:51:25,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 253 transitions. [2021-08-27 07:51:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 07:51:25,370 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:25,370 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:25,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 07:51:25,371 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:25,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:25,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1399928825, now seen corresponding path program 1 times [2021-08-27 07:51:25,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:25,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215128312] [2021-08-27 07:51:25,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:25,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:25,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:25,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215128312] [2021-08-27 07:51:25,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215128312] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:25,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:25,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:25,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305033154] [2021-08-27 07:51:25,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:25,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:25,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:25,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:25,407 INFO L87 Difference]: Start difference. First operand 151 states and 253 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:25,477 INFO L93 Difference]: Finished difference Result 209 states and 344 transitions. [2021-08-27 07:51:25,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:25,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 07:51:25,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:25,478 INFO L225 Difference]: With dead ends: 209 [2021-08-27 07:51:25,479 INFO L226 Difference]: Without dead ends: 209 [2021-08-27 07:51:25,479 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:25,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-08-27 07:51:25,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2021-08-27 07:51:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 343 transitions. [2021-08-27 07:51:25,484 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 343 transitions. Word has length 21 [2021-08-27 07:51:25,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:25,484 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 343 transitions. [2021-08-27 07:51:25,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 343 transitions. [2021-08-27 07:51:25,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 07:51:25,485 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:25,486 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:25,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 07:51:25,486 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:25,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:25,486 INFO L82 PathProgramCache]: Analyzing trace with hash 190169890, now seen corresponding path program 1 times [2021-08-27 07:51:25,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:25,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603747175] [2021-08-27 07:51:25,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:25,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:25,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:25,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603747175] [2021-08-27 07:51:25,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603747175] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:25,519 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:25,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:25,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027664537] [2021-08-27 07:51:25,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:25,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:25,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:25,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:25,521 INFO L87 Difference]: Start difference. First operand 207 states and 343 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:25,586 INFO L93 Difference]: Finished difference Result 215 states and 348 transitions. [2021-08-27 07:51:25,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:25,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 07:51:25,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:25,587 INFO L225 Difference]: With dead ends: 215 [2021-08-27 07:51:25,587 INFO L226 Difference]: Without dead ends: 215 [2021-08-27 07:51:25,588 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-08-27 07:51:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2021-08-27 07:51:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 347 transitions. [2021-08-27 07:51:25,591 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 347 transitions. Word has length 22 [2021-08-27 07:51:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:25,591 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 347 transitions. [2021-08-27 07:51:25,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 347 transitions. [2021-08-27 07:51:25,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 07:51:25,592 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:25,592 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:25,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 07:51:25,593 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:25,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash 448335328, now seen corresponding path program 1 times [2021-08-27 07:51:25,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:25,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903819632] [2021-08-27 07:51:25,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:25,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:25,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:25,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903819632] [2021-08-27 07:51:25,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903819632] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:25,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:25,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:25,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934556237] [2021-08-27 07:51:25,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:25,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:25,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:25,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:25,635 INFO L87 Difference]: Start difference. First operand 213 states and 347 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:25,700 INFO L93 Difference]: Finished difference Result 379 states and 620 transitions. [2021-08-27 07:51:25,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:25,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 07:51:25,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:25,702 INFO L225 Difference]: With dead ends: 379 [2021-08-27 07:51:25,702 INFO L226 Difference]: Without dead ends: 379 [2021-08-27 07:51:25,702 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:25,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-08-27 07:51:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 297. [2021-08-27 07:51:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 475 transitions. [2021-08-27 07:51:25,707 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 475 transitions. Word has length 22 [2021-08-27 07:51:25,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:25,707 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 475 transitions. [2021-08-27 07:51:25,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,707 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 475 transitions. [2021-08-27 07:51:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 07:51:25,708 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:25,708 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:25,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 07:51:25,708 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:25,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:25,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1149399906, now seen corresponding path program 1 times [2021-08-27 07:51:25,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:25,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039766153] [2021-08-27 07:51:25,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:25,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:25,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:25,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039766153] [2021-08-27 07:51:25,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039766153] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:25,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:25,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:25,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831706414] [2021-08-27 07:51:25,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:25,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:25,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:25,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:25,742 INFO L87 Difference]: Start difference. First operand 297 states and 475 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:25,808 INFO L93 Difference]: Finished difference Result 403 states and 632 transitions. [2021-08-27 07:51:25,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:25,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 07:51:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:25,809 INFO L225 Difference]: With dead ends: 403 [2021-08-27 07:51:25,809 INFO L226 Difference]: Without dead ends: 403 [2021-08-27 07:51:25,810 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:25,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-08-27 07:51:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2021-08-27 07:51:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 631 transitions. [2021-08-27 07:51:25,815 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 631 transitions. Word has length 22 [2021-08-27 07:51:25,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:25,815 INFO L470 AbstractCegarLoop]: Abstraction has 401 states and 631 transitions. [2021-08-27 07:51:25,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 631 transitions. [2021-08-27 07:51:25,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 07:51:25,816 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:25,816 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:25,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 07:51:25,817 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:25,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:25,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1013708334, now seen corresponding path program 1 times [2021-08-27 07:51:25,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:25,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356861703] [2021-08-27 07:51:25,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:25,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:25,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:25,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356861703] [2021-08-27 07:51:25,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356861703] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:25,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:25,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:25,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335594028] [2021-08-27 07:51:25,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:25,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:25,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:25,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:25,866 INFO L87 Difference]: Start difference. First operand 401 states and 631 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:25,930 INFO L93 Difference]: Finished difference Result 411 states and 632 transitions. [2021-08-27 07:51:25,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:25,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 07:51:25,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:25,932 INFO L225 Difference]: With dead ends: 411 [2021-08-27 07:51:25,932 INFO L226 Difference]: Without dead ends: 411 [2021-08-27 07:51:25,932 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:25,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2021-08-27 07:51:25,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2021-08-27 07:51:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 631 transitions. [2021-08-27 07:51:25,937 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 631 transitions. Word has length 23 [2021-08-27 07:51:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:25,938 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 631 transitions. [2021-08-27 07:51:25,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 631 transitions. [2021-08-27 07:51:25,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 07:51:25,938 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:25,938 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:25,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 07:51:25,939 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:25,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:25,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1271873772, now seen corresponding path program 1 times [2021-08-27 07:51:25,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:25,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313881582] [2021-08-27 07:51:25,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:25,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:25,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:25,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313881582] [2021-08-27 07:51:25,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313881582] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:25,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:25,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:25,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600298414] [2021-08-27 07:51:25,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:25,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:25,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:25,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:25,969 INFO L87 Difference]: Start difference. First operand 409 states and 631 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:26,033 INFO L93 Difference]: Finished difference Result 715 states and 1104 transitions. [2021-08-27 07:51:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:26,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 07:51:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:26,036 INFO L225 Difference]: With dead ends: 715 [2021-08-27 07:51:26,036 INFO L226 Difference]: Without dead ends: 715 [2021-08-27 07:51:26,036 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:26,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2021-08-27 07:51:26,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 585. [2021-08-27 07:51:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 879 transitions. [2021-08-27 07:51:26,045 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 879 transitions. Word has length 23 [2021-08-27 07:51:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:26,045 INFO L470 AbstractCegarLoop]: Abstraction has 585 states and 879 transitions. [2021-08-27 07:51:26,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 879 transitions. [2021-08-27 07:51:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 07:51:26,046 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:26,046 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:26,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 07:51:26,046 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:26,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:26,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1972938350, now seen corresponding path program 1 times [2021-08-27 07:51:26,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:26,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702747805] [2021-08-27 07:51:26,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:26,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:26,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:26,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702747805] [2021-08-27 07:51:26,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702747805] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:26,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:26,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:26,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722724636] [2021-08-27 07:51:26,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:26,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:26,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:26,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:26,091 INFO L87 Difference]: Start difference. First operand 585 states and 879 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:26,166 INFO L93 Difference]: Finished difference Result 779 states and 1144 transitions. [2021-08-27 07:51:26,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:26,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 07:51:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:26,168 INFO L225 Difference]: With dead ends: 779 [2021-08-27 07:51:26,168 INFO L226 Difference]: Without dead ends: 779 [2021-08-27 07:51:26,169 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2021-08-27 07:51:26,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2021-08-27 07:51:26,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1143 transitions. [2021-08-27 07:51:26,179 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1143 transitions. Word has length 23 [2021-08-27 07:51:26,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:26,179 INFO L470 AbstractCegarLoop]: Abstraction has 777 states and 1143 transitions. [2021-08-27 07:51:26,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1143 transitions. [2021-08-27 07:51:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 07:51:26,180 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:26,180 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:26,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 07:51:26,181 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:26,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:26,181 INFO L82 PathProgramCache]: Analyzing trace with hash 773596663, now seen corresponding path program 1 times [2021-08-27 07:51:26,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:26,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351994809] [2021-08-27 07:51:26,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:26,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:26,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:26,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351994809] [2021-08-27 07:51:26,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351994809] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:26,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:26,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:26,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299584091] [2021-08-27 07:51:26,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:26,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:26,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:26,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:26,214 INFO L87 Difference]: Start difference. First operand 777 states and 1143 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:26,278 INFO L93 Difference]: Finished difference Result 795 states and 1144 transitions. [2021-08-27 07:51:26,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:26,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 07:51:26,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:26,281 INFO L225 Difference]: With dead ends: 795 [2021-08-27 07:51:26,281 INFO L226 Difference]: Without dead ends: 795 [2021-08-27 07:51:26,281 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:26,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2021-08-27 07:51:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2021-08-27 07:51:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1143 transitions. [2021-08-27 07:51:26,290 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1143 transitions. Word has length 24 [2021-08-27 07:51:26,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:26,291 INFO L470 AbstractCegarLoop]: Abstraction has 793 states and 1143 transitions. [2021-08-27 07:51:26,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,291 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1143 transitions. [2021-08-27 07:51:26,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 07:51:26,292 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:26,292 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:26,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 07:51:26,292 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:26,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:26,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1031762101, now seen corresponding path program 1 times [2021-08-27 07:51:26,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:26,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376116700] [2021-08-27 07:51:26,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:26,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:26,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:26,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376116700] [2021-08-27 07:51:26,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376116700] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:26,325 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:26,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:26,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17775906] [2021-08-27 07:51:26,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:26,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:26,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:26,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:26,327 INFO L87 Difference]: Start difference. First operand 793 states and 1143 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:26,411 INFO L93 Difference]: Finished difference Result 1355 states and 1944 transitions. [2021-08-27 07:51:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:26,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 07:51:26,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:26,414 INFO L225 Difference]: With dead ends: 1355 [2021-08-27 07:51:26,415 INFO L226 Difference]: Without dead ends: 1355 [2021-08-27 07:51:26,415 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:26,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2021-08-27 07:51:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1161. [2021-08-27 07:51:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1623 transitions. [2021-08-27 07:51:26,428 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1623 transitions. Word has length 24 [2021-08-27 07:51:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:26,428 INFO L470 AbstractCegarLoop]: Abstraction has 1161 states and 1623 transitions. [2021-08-27 07:51:26,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1623 transitions. [2021-08-27 07:51:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 07:51:26,430 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:26,430 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:26,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 07:51:26,431 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:26,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:26,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1732826679, now seen corresponding path program 1 times [2021-08-27 07:51:26,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:26,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006625102] [2021-08-27 07:51:26,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:26,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:26,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:26,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006625102] [2021-08-27 07:51:26,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006625102] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:26,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:26,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:26,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558376732] [2021-08-27 07:51:26,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:26,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:26,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:26,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:26,469 INFO L87 Difference]: Start difference. First operand 1161 states and 1623 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:26,535 INFO L93 Difference]: Finished difference Result 1515 states and 2056 transitions. [2021-08-27 07:51:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:26,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 07:51:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:26,538 INFO L225 Difference]: With dead ends: 1515 [2021-08-27 07:51:26,538 INFO L226 Difference]: Without dead ends: 1515 [2021-08-27 07:51:26,539 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:26,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2021-08-27 07:51:26,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1513. [2021-08-27 07:51:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2055 transitions. [2021-08-27 07:51:26,556 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2055 transitions. Word has length 24 [2021-08-27 07:51:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:26,556 INFO L470 AbstractCegarLoop]: Abstraction has 1513 states and 2055 transitions. [2021-08-27 07:51:26,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2055 transitions. [2021-08-27 07:51:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:51:26,558 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:26,558 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:26,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 07:51:26,558 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:26,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:26,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1920069795, now seen corresponding path program 1 times [2021-08-27 07:51:26,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:26,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146856959] [2021-08-27 07:51:26,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:26,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:26,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:26,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146856959] [2021-08-27 07:51:26,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146856959] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:26,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:26,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:26,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855913220] [2021-08-27 07:51:26,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:26,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:26,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:26,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:26,589 INFO L87 Difference]: Start difference. First operand 1513 states and 2055 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:26,652 INFO L93 Difference]: Finished difference Result 1547 states and 2056 transitions. [2021-08-27 07:51:26,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:26,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 07:51:26,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:26,656 INFO L225 Difference]: With dead ends: 1547 [2021-08-27 07:51:26,656 INFO L226 Difference]: Without dead ends: 1547 [2021-08-27 07:51:26,656 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2021-08-27 07:51:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1545. [2021-08-27 07:51:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2055 transitions. [2021-08-27 07:51:26,692 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2055 transitions. Word has length 25 [2021-08-27 07:51:26,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:26,692 INFO L470 AbstractCegarLoop]: Abstraction has 1545 states and 2055 transitions. [2021-08-27 07:51:26,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2055 transitions. [2021-08-27 07:51:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:51:26,694 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:26,694 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:26,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 07:51:26,694 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:26,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:26,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2116732063, now seen corresponding path program 1 times [2021-08-27 07:51:26,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:26,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149171770] [2021-08-27 07:51:26,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:26,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:26,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:26,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149171770] [2021-08-27 07:51:26,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149171770] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:26,723 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:26,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:26,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040155213] [2021-08-27 07:51:26,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:26,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:26,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:26,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:26,724 INFO L87 Difference]: Start difference. First operand 1545 states and 2055 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:26,791 INFO L93 Difference]: Finished difference Result 2571 states and 3368 transitions. [2021-08-27 07:51:26,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:26,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 07:51:26,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:26,796 INFO L225 Difference]: With dead ends: 2571 [2021-08-27 07:51:26,796 INFO L226 Difference]: Without dead ends: 2571 [2021-08-27 07:51:26,796 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2021-08-27 07:51:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2313. [2021-08-27 07:51:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 2983 transitions. [2021-08-27 07:51:26,824 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 2983 transitions. Word has length 25 [2021-08-27 07:51:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:26,824 INFO L470 AbstractCegarLoop]: Abstraction has 2313 states and 2983 transitions. [2021-08-27 07:51:26,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2983 transitions. [2021-08-27 07:51:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:51:26,827 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:26,827 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:26,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 07:51:26,827 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:26,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:26,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1415667485, now seen corresponding path program 1 times [2021-08-27 07:51:26,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:26,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207193116] [2021-08-27 07:51:26,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:26,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:26,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:26,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207193116] [2021-08-27 07:51:26,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207193116] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:26,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:26,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:26,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479561562] [2021-08-27 07:51:26,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:26,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:26,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:26,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:26,856 INFO L87 Difference]: Start difference. First operand 2313 states and 2983 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:26,937 INFO L93 Difference]: Finished difference Result 2955 states and 3656 transitions. [2021-08-27 07:51:26,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:26,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 07:51:26,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:26,942 INFO L225 Difference]: With dead ends: 2955 [2021-08-27 07:51:26,943 INFO L226 Difference]: Without dead ends: 2955 [2021-08-27 07:51:26,943 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:26,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2021-08-27 07:51:26,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2021-08-27 07:51:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3655 transitions. [2021-08-27 07:51:26,974 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3655 transitions. Word has length 25 [2021-08-27 07:51:26,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:26,974 INFO L470 AbstractCegarLoop]: Abstraction has 2953 states and 3655 transitions. [2021-08-27 07:51:26,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3655 transitions. [2021-08-27 07:51:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 07:51:26,976 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:26,976 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:26,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 07:51:26,977 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:26,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:26,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1193968436, now seen corresponding path program 1 times [2021-08-27 07:51:26,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:26,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132511524] [2021-08-27 07:51:26,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:26,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:27,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:27,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:27,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132511524] [2021-08-27 07:51:27,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132511524] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:27,005 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:27,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:27,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017749143] [2021-08-27 07:51:27,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:27,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:27,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:27,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:27,006 INFO L87 Difference]: Start difference. First operand 2953 states and 3655 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:27,071 INFO L93 Difference]: Finished difference Result 3019 states and 3656 transitions. [2021-08-27 07:51:27,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:27,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 07:51:27,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:27,077 INFO L225 Difference]: With dead ends: 3019 [2021-08-27 07:51:27,077 INFO L226 Difference]: Without dead ends: 3019 [2021-08-27 07:51:27,078 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2021-08-27 07:51:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3017. [2021-08-27 07:51:27,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3655 transitions. [2021-08-27 07:51:27,133 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3655 transitions. Word has length 26 [2021-08-27 07:51:27,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:27,133 INFO L470 AbstractCegarLoop]: Abstraction has 3017 states and 3655 transitions. [2021-08-27 07:51:27,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3655 transitions. [2021-08-27 07:51:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 07:51:27,135 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:27,135 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:27,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 07:51:27,136 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:27,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:27,136 INFO L82 PathProgramCache]: Analyzing trace with hash -935802998, now seen corresponding path program 1 times [2021-08-27 07:51:27,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:27,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872903953] [2021-08-27 07:51:27,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:27,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:27,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:27,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:27,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872903953] [2021-08-27 07:51:27,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872903953] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:27,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:27,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:27,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631381168] [2021-08-27 07:51:27,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:27,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:27,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:27,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:27,167 INFO L87 Difference]: Start difference. First operand 3017 states and 3655 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:27,240 INFO L93 Difference]: Finished difference Result 4873 states and 5703 transitions. [2021-08-27 07:51:27,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:27,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 07:51:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:27,250 INFO L225 Difference]: With dead ends: 4873 [2021-08-27 07:51:27,250 INFO L226 Difference]: Without dead ends: 4873 [2021-08-27 07:51:27,250 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:27,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2021-08-27 07:51:27,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4617. [2021-08-27 07:51:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 5447 transitions. [2021-08-27 07:51:27,311 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 5447 transitions. Word has length 26 [2021-08-27 07:51:27,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:27,311 INFO L470 AbstractCegarLoop]: Abstraction has 4617 states and 5447 transitions. [2021-08-27 07:51:27,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 5447 transitions. [2021-08-27 07:51:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 07:51:27,315 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:27,315 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:27,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 07:51:27,315 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:27,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:27,316 INFO L82 PathProgramCache]: Analyzing trace with hash -234738420, now seen corresponding path program 1 times [2021-08-27 07:51:27,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:27,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940711081] [2021-08-27 07:51:27,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:27,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:27,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:27,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:27,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940711081] [2021-08-27 07:51:27,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940711081] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:27,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:27,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:27,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48453989] [2021-08-27 07:51:27,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:27,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:27,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:27,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:27,352 INFO L87 Difference]: Start difference. First operand 4617 states and 5447 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:27,422 INFO L93 Difference]: Finished difference Result 5767 states and 6406 transitions. [2021-08-27 07:51:27,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:27,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 07:51:27,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:27,423 INFO L225 Difference]: With dead ends: 5767 [2021-08-27 07:51:27,423 INFO L226 Difference]: Without dead ends: 0 [2021-08-27 07:51:27,423 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-27 07:51:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-27 07:51:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 07:51:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 07:51:27,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2021-08-27 07:51:27,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:27,424 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 07:51:27,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-27 07:51:27,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-27 07:51:27,427 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 07:51:27,427 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 07:51:27,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 07:51:27,430 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 07:51:27,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 07:51:27 BoogieIcfgContainer [2021-08-27 07:51:27,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 07:51:27,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 07:51:27,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 07:51:27,432 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 07:51:27,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:51:24" (3/4) ... [2021-08-27 07:51:27,434 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-27 07:51:27,438 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-08-27 07:51:27,438 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-08-27 07:51:27,439 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-08-27 07:51:27,441 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-08-27 07:51:27,442 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-27 07:51:27,442 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-27 07:51:27,442 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-27 07:51:27,463 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 07:51:27,463 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 07:51:27,464 INFO L168 Benchmark]: Toolchain (without parser) took 3725.95 ms. Allocated memory was 65.0 MB in the beginning and 249.6 MB in the end (delta: 184.5 MB). Free memory was 46.0 MB in the beginning and 105.1 MB in the end (delta: -59.1 MB). Peak memory consumption was 123.7 MB. Max. memory is 16.1 GB. [2021-08-27 07:51:27,465 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 65.0 MB. Free memory is still 47.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:51:27,465 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.89 ms. Allocated memory is still 65.0 MB. Free memory was 45.7 MB in the beginning and 48.2 MB in the end (delta: -2.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 07:51:27,465 INFO L168 Benchmark]: Boogie Preprocessor took 20.88 ms. Allocated memory is still 65.0 MB. Free memory was 48.2 MB in the beginning and 46.6 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:51:27,466 INFO L168 Benchmark]: RCFGBuilder took 237.37 ms. Allocated memory was 65.0 MB in the beginning and 90.2 MB in the end (delta: 25.2 MB). Free memory was 46.4 MB in the beginning and 69.7 MB in the end (delta: -23.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 16.1 GB. [2021-08-27 07:51:27,466 INFO L168 Benchmark]: TraceAbstraction took 3228.04 ms. Allocated memory was 90.2 MB in the beginning and 249.6 MB in the end (delta: 159.4 MB). Free memory was 69.3 MB in the beginning and 108.2 MB in the end (delta: -38.9 MB). Peak memory consumption was 121.3 MB. Max. memory is 16.1 GB. [2021-08-27 07:51:27,466 INFO L168 Benchmark]: Witness Printer took 31.38 ms. Allocated memory is still 249.6 MB. Free memory was 108.2 MB in the beginning and 105.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 07:51:27,467 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.14 ms. Allocated memory is still 65.0 MB. Free memory is still 47.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 202.89 ms. Allocated memory is still 65.0 MB. Free memory was 45.7 MB in the beginning and 48.2 MB in the end (delta: -2.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.88 ms. Allocated memory is still 65.0 MB. Free memory was 48.2 MB in the beginning and 46.6 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 237.37 ms. Allocated memory was 65.0 MB in the beginning and 90.2 MB in the end (delta: 25.2 MB). Free memory was 46.4 MB in the beginning and 69.7 MB in the end (delta: -23.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 3228.04 ms. Allocated memory was 90.2 MB in the beginning and 249.6 MB in the end (delta: 159.4 MB). Free memory was 69.3 MB in the beginning and 108.2 MB in the end (delta: -38.9 MB). Peak memory consumption was 121.3 MB. Max. memory is 16.1 GB. * Witness Printer took 31.38 ms. Allocated memory is still 249.6 MB. Free memory was 108.2 MB in the beginning and 105.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 135]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 3195.7ms, OverallIterations: 23, TraceHistogramMax: 1, EmptinessCheckTime: 30.7ms, AutomataDifference: 1744.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1594 SDtfs, 2287 SDslu, 135 SDs, 0 SdLazy, 1123 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 936.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 720.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4617occurred in iteration=22, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 337.8ms AutomataMinimizationTime, 23 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 25.0ms SsaConstructionTime, 104.6ms SatisfiabilityAnalysisTime, 753.0ms InterpolantComputationTime, 509 NumberOfCodeBlocks, 509 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 486 ConstructedInterpolants, 0 QuantifiedInterpolants, 1592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-08-27 07:51:27,494 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...