./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_13.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_13.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 837e2aefd0844822f4a3cad7b5ee89b7191bc2c1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:50:40,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 07:50:40,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 07:50:41,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 07:50:41,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 07:50:41,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 07:50:41,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 07:50:41,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 07:50:41,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 07:50:41,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 07:50:41,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 07:50:41,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 07:50:41,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 07:50:41,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 07:50:41,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 07:50:41,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 07:50:41,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 07:50:41,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 07:50:41,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 07:50:41,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 07:50:41,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 07:50:41,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 07:50:41,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 07:50:41,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 07:50:41,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 07:50:41,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 07:50:41,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 07:50:41,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 07:50:41,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 07:50:41,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 07:50:41,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 07:50:41,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 07:50:41,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 07:50:41,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 07:50:41,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 07:50:41,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 07:50:41,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 07:50:41,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 07:50:41,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 07:50:41,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 07:50:41,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 07:50:41,094 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:50:41,124 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 07:50:41,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 07:50:41,125 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 07:50:41,125 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 07:50:41,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 07:50:41,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 07:50:41,127 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 07:50:41,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 07:50:41,127 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 07:50:41,127 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 07:50:41,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 07:50:41,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 07:50:41,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 07:50:41,128 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 07:50:41,128 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 07:50:41,128 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 07:50:41,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 07:50:41,128 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 07:50:41,128 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 07:50:41,128 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 07:50:41,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 07:50:41,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 07:50:41,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 07:50:41,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:50:41,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 07:50:41,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 07:50:41,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 07:50:41,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 07:50:41,129 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 07:50:41,129 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 -> 837e2aefd0844822f4a3cad7b5ee89b7191bc2c1 [2021-08-27 07:50:41,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 07:50:41,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 07:50:41,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 07:50:41,410 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 07:50:41,410 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 07:50:41,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2021-08-27 07:50:41,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55736fb02/f5366f6631e640d28d3d9e6183d23c96/FLAG514b587fc [2021-08-27 07:50:41,868 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 07:50:41,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2021-08-27 07:50:41,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55736fb02/f5366f6631e640d28d3d9e6183d23c96/FLAG514b587fc [2021-08-27 07:50:41,884 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55736fb02/f5366f6631e640d28d3d9e6183d23c96 [2021-08-27 07:50:41,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 07:50:41,887 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 07:50:41,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 07:50:41,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 07:50:41,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 07:50:41,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:50:41" (1/1) ... [2021-08-27 07:50:41,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@527565a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:41, skipping insertion in model container [2021-08-27 07:50:41,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:50:41" (1/1) ... [2021-08-27 07:50:41,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 07:50:41,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 07:50:42,042 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_13.c[4936,4949] [2021-08-27 07:50:42,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:50:42,061 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 07:50:42,130 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_13.c[4936,4949] [2021-08-27 07:50:42,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:50:42,139 INFO L208 MainTranslator]: Completed translation [2021-08-27 07:50:42,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:42 WrapperNode [2021-08-27 07:50:42,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 07:50:42,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 07:50:42,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 07:50:42,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 07:50:42,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:42" (1/1) ... [2021-08-27 07:50:42,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:42" (1/1) ... [2021-08-27 07:50:42,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:42" (1/1) ... [2021-08-27 07:50:42,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:42" (1/1) ... [2021-08-27 07:50:42,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:42" (1/1) ... [2021-08-27 07:50:42,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:42" (1/1) ... [2021-08-27 07:50:42,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:42" (1/1) ... [2021-08-27 07:50:42,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 07:50:42,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 07:50:42,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 07:50:42,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 07:50:42,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:42" (1/1) ... [2021-08-27 07:50:42,193 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:50:42,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:50:42,231 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:50:42,276 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:50:42,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 07:50:42,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 07:50:42,306 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 07:50:42,306 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 07:50:42,307 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 07:50:42,307 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 07:50:42,307 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 07:50:42,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 07:50:42,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 07:50:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 07:50:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 07:50:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 07:50:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 07:50:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 07:50:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 07:50:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 07:50:42,708 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 07:50:42,708 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-08-27 07:50:42,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:50:42 BoogieIcfgContainer [2021-08-27 07:50:42,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 07:50:42,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 07:50:42,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 07:50:42,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 07:50:42,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 07:50:41" (1/3) ... [2021-08-27 07:50:42,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669ef5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:50:42, skipping insertion in model container [2021-08-27 07:50:42,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:42" (2/3) ... [2021-08-27 07:50:42,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669ef5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:50:42, skipping insertion in model container [2021-08-27 07:50:42,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:50:42" (3/3) ... [2021-08-27 07:50:42,714 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2021-08-27 07:50:42,717 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 07:50:42,717 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-27 07:50:42,745 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 07:50:42,749 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:50:42,749 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-27 07:50:42,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 50 states have internal predecessors, (92), 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:50:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 07:50:42,763 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:42,763 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:42,764 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr1ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:42,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:42,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2110827245, now seen corresponding path program 1 times [2021-08-27 07:50:42,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:42,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550074639] [2021-08-27 07:50:42,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:42,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:42,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:42,996 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:50:42,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:42,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550074639] [2021-08-27 07:50:42,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550074639] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:42,997 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:42,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 07:50:42,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280996863] [2021-08-27 07:50:43,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 07:50:43,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:43,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 07:50:43,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:43,020 INFO L87 Difference]: Start difference. First operand has 55 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 50 states have internal predecessors, (92), 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:50:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:43,061 INFO L93 Difference]: Finished difference Result 54 states and 92 transitions. [2021-08-27 07:50:43,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:50:43,063 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:50:43,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:43,069 INFO L225 Difference]: With dead ends: 54 [2021-08-27 07:50:43,069 INFO L226 Difference]: Without dead ends: 49 [2021-08-27 07:50:43,071 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:43,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-08-27 07:50:43,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-08-27 07:50:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 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:50:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 87 transitions. [2021-08-27 07:50:43,099 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 87 transitions. Word has length 9 [2021-08-27 07:50:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:43,100 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 87 transitions. [2021-08-27 07:50:43,100 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:50:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 87 transitions. [2021-08-27 07:50:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 07:50:43,101 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:43,101 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:50:43,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 07:50:43,102 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:43,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:43,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2016062836, now seen corresponding path program 1 times [2021-08-27 07:50:43,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:43,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008131526] [2021-08-27 07:50:43,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:43,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:43,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:43,241 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:50:43,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:43,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008131526] [2021-08-27 07:50:43,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008131526] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:43,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:43,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:43,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111481989] [2021-08-27 07:50:43,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:43,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:43,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:43,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:43,244 INFO L87 Difference]: Start difference. First operand 49 states and 87 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:50:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:43,526 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions. [2021-08-27 07:50:43,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:43,527 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:50:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:43,532 INFO L225 Difference]: With dead ends: 91 [2021-08-27 07:50:43,532 INFO L226 Difference]: Without dead ends: 91 [2021-08-27 07:50:43,532 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 88.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-08-27 07:50:43,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 63. [2021-08-27 07:50:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.88135593220339) internal successors, (111), 59 states have internal predecessors, (111), 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:50:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 114 transitions. [2021-08-27 07:50:43,538 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 114 transitions. Word has length 24 [2021-08-27 07:50:43,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:43,539 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 114 transitions. [2021-08-27 07:50:43,539 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:50:43,539 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 114 transitions. [2021-08-27 07:50:43,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 07:50:43,539 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:43,539 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:50:43,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 07:50:43,540 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:43,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:43,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1257836106, now seen corresponding path program 1 times [2021-08-27 07:50:43,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:43,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599924791] [2021-08-27 07:50:43,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:43,541 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:43,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:43,641 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:50:43,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:43,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599924791] [2021-08-27 07:50:43,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599924791] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:43,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:43,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:43,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678066807] [2021-08-27 07:50:43,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:43,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:43,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:43,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:43,646 INFO L87 Difference]: Start difference. First operand 63 states and 114 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:50:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:43,860 INFO L93 Difference]: Finished difference Result 91 states and 163 transitions. [2021-08-27 07:50:43,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:43,860 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:50:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:43,861 INFO L225 Difference]: With dead ends: 91 [2021-08-27 07:50:43,861 INFO L226 Difference]: Without dead ends: 91 [2021-08-27 07:50:43,861 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 68.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-08-27 07:50:43,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2021-08-27 07:50:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 85 states have internal predecessors, (159), 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:50:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 162 transitions. [2021-08-27 07:50:43,867 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 162 transitions. Word has length 24 [2021-08-27 07:50:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:43,867 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 162 transitions. [2021-08-27 07:50:43,867 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:50:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 162 transitions. [2021-08-27 07:50:43,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:50:43,867 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:43,868 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:50:43,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 07:50:43,868 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:43,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:43,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1926773935, now seen corresponding path program 1 times [2021-08-27 07:50:43,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:43,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456595457] [2021-08-27 07:50:43,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:43,869 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:43,945 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:50:43,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:43,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456595457] [2021-08-27 07:50:43,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456595457] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:43,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:43,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:43,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065680925] [2021-08-27 07:50:43,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:43,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:43,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:43,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:43,952 INFO L87 Difference]: Start difference. First operand 89 states and 162 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:50:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:44,117 INFO L93 Difference]: Finished difference Result 94 states and 165 transitions. [2021-08-27 07:50:44,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:44,118 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:50:44,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:44,119 INFO L225 Difference]: With dead ends: 94 [2021-08-27 07:50:44,119 INFO L226 Difference]: Without dead ends: 94 [2021-08-27 07:50:44,119 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:44,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-08-27 07:50:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2021-08-27 07:50:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 88 states have internal predecessors, (161), 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:50:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2021-08-27 07:50:44,124 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 25 [2021-08-27 07:50:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:44,127 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2021-08-27 07:50:44,127 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:50:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2021-08-27 07:50:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:50:44,128 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:44,128 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:50:44,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 07:50:44,128 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:44,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:44,128 INFO L82 PathProgramCache]: Analyzing trace with hash 338426033, now seen corresponding path program 1 times [2021-08-27 07:50:44,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:44,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123041483] [2021-08-27 07:50:44,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:44,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:44,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:44,170 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:50:44,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:44,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123041483] [2021-08-27 07:50:44,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123041483] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:44,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:44,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:44,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69857101] [2021-08-27 07:50:44,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:44,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:44,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:44,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:44,172 INFO L87 Difference]: Start difference. First operand 92 states and 164 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:50:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:44,315 INFO L93 Difference]: Finished difference Result 173 states and 310 transitions. [2021-08-27 07:50:44,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:44,315 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:50:44,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:44,317 INFO L225 Difference]: With dead ends: 173 [2021-08-27 07:50:44,318 INFO L226 Difference]: Without dead ends: 173 [2021-08-27 07:50:44,318 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:44,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-08-27 07:50:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2021-08-27 07:50:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.8323353293413174) internal successors, (306), 167 states have internal predecessors, (306), 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:50:44,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 309 transitions. [2021-08-27 07:50:44,341 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 309 transitions. Word has length 25 [2021-08-27 07:50:44,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:44,341 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 309 transitions. [2021-08-27 07:50:44,342 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:50:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 309 transitions. [2021-08-27 07:50:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:50:44,343 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:44,343 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:50:44,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 07:50:44,344 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:44,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:44,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1359494387, now seen corresponding path program 1 times [2021-08-27 07:50:44,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:44,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314632071] [2021-08-27 07:50:44,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:44,348 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:44,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:44,400 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:50:44,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:44,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314632071] [2021-08-27 07:50:44,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314632071] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:44,405 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:44,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:44,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141211324] [2021-08-27 07:50:44,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:44,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:44,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:44,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:44,406 INFO L87 Difference]: Start difference. First operand 171 states and 309 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:50:44,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:44,527 INFO L93 Difference]: Finished difference Result 221 states and 400 transitions. [2021-08-27 07:50:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:44,528 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:50:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:44,529 INFO L225 Difference]: With dead ends: 221 [2021-08-27 07:50:44,529 INFO L226 Difference]: Without dead ends: 221 [2021-08-27 07:50:44,530 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-08-27 07:50:44,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 171. [2021-08-27 07:50:44,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.8203592814371257) internal successors, (304), 167 states have internal predecessors, (304), 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:50:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 307 transitions. [2021-08-27 07:50:44,534 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 307 transitions. Word has length 25 [2021-08-27 07:50:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:44,534 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 307 transitions. [2021-08-27 07:50:44,535 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:50:44,535 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 307 transitions. [2021-08-27 07:50:44,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 07:50:44,535 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:44,535 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:50:44,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 07:50:44,536 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:44,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:44,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485183, now seen corresponding path program 1 times [2021-08-27 07:50:44,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:44,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455461717] [2021-08-27 07:50:44,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:44,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:44,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:44,604 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:50:44,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:44,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455461717] [2021-08-27 07:50:44,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455461717] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:44,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:44,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:44,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063732257] [2021-08-27 07:50:44,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:44,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:44,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:44,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:44,607 INFO L87 Difference]: Start difference. First operand 171 states and 307 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:50:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:44,717 INFO L93 Difference]: Finished difference Result 321 states and 582 transitions. [2021-08-27 07:50:44,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:44,718 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:50:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:44,719 INFO L225 Difference]: With dead ends: 321 [2021-08-27 07:50:44,719 INFO L226 Difference]: Without dead ends: 321 [2021-08-27 07:50:44,719 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:50:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-08-27 07:50:44,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 231. [2021-08-27 07:50:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 227 states have (on average 1.8061674008810573) internal successors, (410), 227 states have internal predecessors, (410), 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:50:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 413 transitions. [2021-08-27 07:50:44,725 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 413 transitions. Word has length 26 [2021-08-27 07:50:44,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:44,725 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 413 transitions. [2021-08-27 07:50:44,725 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:50:44,725 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 413 transitions. [2021-08-27 07:50:44,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 07:50:44,726 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:44,726 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:50:44,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 07:50:44,726 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:44,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:44,726 INFO L82 PathProgramCache]: Analyzing trace with hash 880416829, now seen corresponding path program 1 times [2021-08-27 07:50:44,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:44,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511342859] [2021-08-27 07:50:44,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:44,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:44,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:44,765 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:50:44,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:44,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511342859] [2021-08-27 07:50:44,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511342859] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:44,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:44,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:44,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969421103] [2021-08-27 07:50:44,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:44,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:44,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:44,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:44,767 INFO L87 Difference]: Start difference. First operand 231 states and 413 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:50:44,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:44,864 INFO L93 Difference]: Finished difference Result 329 states and 584 transitions. [2021-08-27 07:50:44,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:44,865 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:50:44,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:44,866 INFO L225 Difference]: With dead ends: 329 [2021-08-27 07:50:44,866 INFO L226 Difference]: Without dead ends: 329 [2021-08-27 07:50:44,866 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:44,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-08-27 07:50:44,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2021-08-27 07:50:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 323 states have (on average 1.7956656346749227) internal successors, (580), 323 states have internal predecessors, (580), 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:50:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 583 transitions. [2021-08-27 07:50:44,872 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 583 transitions. Word has length 26 [2021-08-27 07:50:44,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:44,872 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 583 transitions. [2021-08-27 07:50:44,872 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:50:44,872 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 583 transitions. [2021-08-27 07:50:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 07:50:44,882 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:44,882 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, 1] [2021-08-27 07:50:44,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 07:50:44,882 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:44,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:44,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1183288378, now seen corresponding path program 1 times [2021-08-27 07:50:44,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:44,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525185589] [2021-08-27 07:50:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:44,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:44,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:44,933 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:50:44,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:44,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525185589] [2021-08-27 07:50:44,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525185589] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:44,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:44,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:44,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585159290] [2021-08-27 07:50:44,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:44,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:44,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:44,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:44,938 INFO L87 Difference]: Start difference. First operand 327 states and 583 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:50:45,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:45,035 INFO L93 Difference]: Finished difference Result 335 states and 588 transitions. [2021-08-27 07:50:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:45,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2021-08-27 07:50:45,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:45,036 INFO L225 Difference]: With dead ends: 335 [2021-08-27 07:50:45,036 INFO L226 Difference]: Without dead ends: 335 [2021-08-27 07:50:45,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-08-27 07:50:45,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2021-08-27 07:50:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 329 states have (on average 1.7750759878419453) internal successors, (584), 329 states have internal predecessors, (584), 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:50:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 587 transitions. [2021-08-27 07:50:45,042 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 587 transitions. Word has length 27 [2021-08-27 07:50:45,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:45,043 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 587 transitions. [2021-08-27 07:50:45,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:50:45,043 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 587 transitions. [2021-08-27 07:50:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 07:50:45,043 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:45,044 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, 1] [2021-08-27 07:50:45,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 07:50:45,044 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:45,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:45,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1523331016, now seen corresponding path program 1 times [2021-08-27 07:50:45,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:45,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363390117] [2021-08-27 07:50:45,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:45,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:45,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:45,098 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:50:45,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:45,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363390117] [2021-08-27 07:50:45,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363390117] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:45,098 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:45,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:45,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550365093] [2021-08-27 07:50:45,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:45,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:45,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:45,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:45,099 INFO L87 Difference]: Start difference. First operand 333 states and 587 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:50:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:45,203 INFO L93 Difference]: Finished difference Result 619 states and 1100 transitions. [2021-08-27 07:50:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:45,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2021-08-27 07:50:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:45,206 INFO L225 Difference]: With dead ends: 619 [2021-08-27 07:50:45,206 INFO L226 Difference]: Without dead ends: 619 [2021-08-27 07:50:45,207 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-08-27 07:50:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 457. [2021-08-27 07:50:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.7483443708609272) internal successors, (792), 453 states have internal predecessors, (792), 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:50:45,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 795 transitions. [2021-08-27 07:50:45,216 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 795 transitions. Word has length 27 [2021-08-27 07:50:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:45,216 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 795 transitions. [2021-08-27 07:50:45,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:50:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 795 transitions. [2021-08-27 07:50:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 07:50:45,218 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:45,218 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, 1] [2021-08-27 07:50:45,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 07:50:45,219 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:45,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:45,219 INFO L82 PathProgramCache]: Analyzing trace with hash 502262662, now seen corresponding path program 1 times [2021-08-27 07:50:45,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:45,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509343775] [2021-08-27 07:50:45,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:45,220 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:45,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:45,266 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:50:45,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:45,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509343775] [2021-08-27 07:50:45,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509343775] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:45,267 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:45,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:45,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917852984] [2021-08-27 07:50:45,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:45,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:45,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:45,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:45,268 INFO L87 Difference]: Start difference. First operand 457 states and 795 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:50:45,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:45,381 INFO L93 Difference]: Finished difference Result 643 states and 1112 transitions. [2021-08-27 07:50:45,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:45,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2021-08-27 07:50:45,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:45,385 INFO L225 Difference]: With dead ends: 643 [2021-08-27 07:50:45,385 INFO L226 Difference]: Without dead ends: 643 [2021-08-27 07:50:45,385 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:50:45,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-08-27 07:50:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2021-08-27 07:50:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 637 states have (on average 1.739403453689168) internal successors, (1108), 637 states have internal predecessors, (1108), 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:50:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1111 transitions. [2021-08-27 07:50:45,399 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1111 transitions. Word has length 27 [2021-08-27 07:50:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:45,399 INFO L470 AbstractCegarLoop]: Abstraction has 641 states and 1111 transitions. [2021-08-27 07:50:45,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:50:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1111 transitions. [2021-08-27 07:50:45,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:50:45,401 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:45,401 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, 1, 1] [2021-08-27 07:50:45,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 07:50:45,401 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:45,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:45,402 INFO L82 PathProgramCache]: Analyzing trace with hash -21165326, now seen corresponding path program 1 times [2021-08-27 07:50:45,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:45,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023972660] [2021-08-27 07:50:45,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:45,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:45,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:45,456 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:50:45,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:45,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023972660] [2021-08-27 07:50:45,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023972660] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:45,457 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:45,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:45,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995243827] [2021-08-27 07:50:45,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:45,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:45,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:45,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:45,458 INFO L87 Difference]: Start difference. First operand 641 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:50:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:45,570 INFO L93 Difference]: Finished difference Result 651 states and 1112 transitions. [2021-08-27 07:50:45,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:45,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2021-08-27 07:50:45,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:45,572 INFO L225 Difference]: With dead ends: 651 [2021-08-27 07:50:45,572 INFO L226 Difference]: Without dead ends: 651 [2021-08-27 07:50:45,572 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:45,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2021-08-27 07:50:45,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2021-08-27 07:50:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 645 states have (on average 1.7178294573643411) internal successors, (1108), 645 states have internal predecessors, (1108), 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:50:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1111 transitions. [2021-08-27 07:50:45,582 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1111 transitions. Word has length 28 [2021-08-27 07:50:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:45,582 INFO L470 AbstractCegarLoop]: Abstraction has 649 states and 1111 transitions. [2021-08-27 07:50:45,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:50:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1111 transitions. [2021-08-27 07:50:45,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:50:45,583 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:45,583 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, 1, 1] [2021-08-27 07:50:45,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 07:50:45,583 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:45,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:45,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1609513228, now seen corresponding path program 1 times [2021-08-27 07:50:45,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:45,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217035714] [2021-08-27 07:50:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:45,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:45,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:45,629 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:50:45,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:45,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217035714] [2021-08-27 07:50:45,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217035714] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:45,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:45,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:45,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97262415] [2021-08-27 07:50:45,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:45,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:45,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:45,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:45,645 INFO L87 Difference]: Start difference. First operand 649 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:50:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:45,747 INFO L93 Difference]: Finished difference Result 1195 states and 2064 transitions. [2021-08-27 07:50:45,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:45,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2021-08-27 07:50:45,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:45,750 INFO L225 Difference]: With dead ends: 1195 [2021-08-27 07:50:45,751 INFO L226 Difference]: Without dead ends: 1195 [2021-08-27 07:50:45,751 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2021-08-27 07:50:45,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 905. [2021-08-27 07:50:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.6825749167591566) internal successors, (1516), 901 states have internal predecessors, (1516), 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:50:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1519 transitions. [2021-08-27 07:50:45,767 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1519 transitions. Word has length 28 [2021-08-27 07:50:45,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:45,767 INFO L470 AbstractCegarLoop]: Abstraction has 905 states and 1519 transitions. [2021-08-27 07:50:45,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:50:45,767 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1519 transitions. [2021-08-27 07:50:45,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:50:45,768 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:45,768 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, 1, 1] [2021-08-27 07:50:45,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 07:50:45,769 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:45,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:45,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1664385714, now seen corresponding path program 1 times [2021-08-27 07:50:45,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:45,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715789554] [2021-08-27 07:50:45,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:45,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:45,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:45,804 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:50:45,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:45,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715789554] [2021-08-27 07:50:45,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715789554] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:45,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:45,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:45,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863927058] [2021-08-27 07:50:45,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:45,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:45,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:45,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:45,805 INFO L87 Difference]: Start difference. First operand 905 states and 1519 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:50:45,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:45,914 INFO L93 Difference]: Finished difference Result 1259 states and 2104 transitions. [2021-08-27 07:50:45,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:45,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2021-08-27 07:50:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:45,919 INFO L225 Difference]: With dead ends: 1259 [2021-08-27 07:50:45,919 INFO L226 Difference]: Without dead ends: 1259 [2021-08-27 07:50:45,919 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2021-08-27 07:50:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1257. [2021-08-27 07:50:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1253 states have (on average 1.675977653631285) internal successors, (2100), 1253 states have internal predecessors, (2100), 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:50:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 2103 transitions. [2021-08-27 07:50:45,940 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 2103 transitions. Word has length 28 [2021-08-27 07:50:45,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:45,941 INFO L470 AbstractCegarLoop]: Abstraction has 1257 states and 2103 transitions. [2021-08-27 07:50:45,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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:50:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 2103 transitions. [2021-08-27 07:50:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 07:50:45,942 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:45,942 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, 1, 1, 1] [2021-08-27 07:50:45,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 07:50:45,942 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:45,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:45,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1644911259, now seen corresponding path program 1 times [2021-08-27 07:50:45,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:45,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338310603] [2021-08-27 07:50:45,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:45,943 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:45,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:45,983 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:50:45,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:45,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338310603] [2021-08-27 07:50:45,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338310603] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:45,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:45,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:45,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361117347] [2021-08-27 07:50:45,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:45,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:45,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:45,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:45,985 INFO L87 Difference]: Start difference. First operand 1257 states and 2103 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:50:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:46,105 INFO L93 Difference]: Finished difference Result 1275 states and 2104 transitions. [2021-08-27 07:50:46,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:46,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2021-08-27 07:50:46,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:46,108 INFO L225 Difference]: With dead ends: 1275 [2021-08-27 07:50:46,108 INFO L226 Difference]: Without dead ends: 1275 [2021-08-27 07:50:46,108 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2021-08-27 07:50:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1273. [2021-08-27 07:50:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1269 states have (on average 1.6548463356973995) internal successors, (2100), 1269 states have internal predecessors, (2100), 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:50:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 2103 transitions. [2021-08-27 07:50:46,123 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 2103 transitions. Word has length 29 [2021-08-27 07:50:46,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:46,123 INFO L470 AbstractCegarLoop]: Abstraction has 1273 states and 2103 transitions. [2021-08-27 07:50:46,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:50:46,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 2103 transitions. [2021-08-27 07:50:46,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 07:50:46,124 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:46,125 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, 1, 1, 1] [2021-08-27 07:50:46,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 07:50:46,125 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:46,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:46,125 INFO L82 PathProgramCache]: Analyzing trace with hash 56563357, now seen corresponding path program 1 times [2021-08-27 07:50:46,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:46,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356496924] [2021-08-27 07:50:46,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:46,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:46,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:46,168 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:50:46,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:46,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356496924] [2021-08-27 07:50:46,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356496924] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:46,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:46,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:46,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581741769] [2021-08-27 07:50:46,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:46,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:46,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:46,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:46,173 INFO L87 Difference]: Start difference. First operand 1273 states and 2103 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:50:46,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:46,289 INFO L93 Difference]: Finished difference Result 2315 states and 3864 transitions. [2021-08-27 07:50:46,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:46,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2021-08-27 07:50:46,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:46,295 INFO L225 Difference]: With dead ends: 2315 [2021-08-27 07:50:46,295 INFO L226 Difference]: Without dead ends: 2315 [2021-08-27 07:50:46,296 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:46,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2021-08-27 07:50:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 1801. [2021-08-27 07:50:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1797 states have (on average 1.613800779076238) internal successors, (2900), 1797 states have internal predecessors, (2900), 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:50:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2903 transitions. [2021-08-27 07:50:46,332 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2903 transitions. Word has length 29 [2021-08-27 07:50:46,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:46,333 INFO L470 AbstractCegarLoop]: Abstraction has 1801 states and 2903 transitions. [2021-08-27 07:50:46,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:50:46,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2903 transitions. [2021-08-27 07:50:46,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 07:50:46,335 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:46,335 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, 1, 1, 1] [2021-08-27 07:50:46,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 07:50:46,335 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:46,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:46,336 INFO L82 PathProgramCache]: Analyzing trace with hash -964504997, now seen corresponding path program 1 times [2021-08-27 07:50:46,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:46,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540285486] [2021-08-27 07:50:46,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:46,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:46,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:46,377 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:50:46,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:46,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540285486] [2021-08-27 07:50:46,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540285486] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:46,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:46,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:46,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538181497] [2021-08-27 07:50:46,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:46,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:46,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:46,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:46,379 INFO L87 Difference]: Start difference. First operand 1801 states and 2903 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:50:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:46,485 INFO L93 Difference]: Finished difference Result 2475 states and 3976 transitions. [2021-08-27 07:50:46,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:46,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2021-08-27 07:50:46,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:46,492 INFO L225 Difference]: With dead ends: 2475 [2021-08-27 07:50:46,493 INFO L226 Difference]: Without dead ends: 2475 [2021-08-27 07:50:46,493 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:46,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2021-08-27 07:50:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2473. [2021-08-27 07:50:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2469 states have (on average 1.608748481166464) internal successors, (3972), 2469 states have internal predecessors, (3972), 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:50:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3975 transitions. [2021-08-27 07:50:46,545 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3975 transitions. Word has length 29 [2021-08-27 07:50:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:46,546 INFO L470 AbstractCegarLoop]: Abstraction has 2473 states and 3975 transitions. [2021-08-27 07:50:46,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:50:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3975 transitions. [2021-08-27 07:50:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 07:50:46,548 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:46,548 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, 1, 1, 1, 1] [2021-08-27 07:50:46,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 07:50:46,548 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:46,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1753678183, now seen corresponding path program 1 times [2021-08-27 07:50:46,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:46,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993027859] [2021-08-27 07:50:46,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:46,549 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:46,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:46,580 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:50:46,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:46,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993027859] [2021-08-27 07:50:46,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993027859] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:46,581 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:46,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:46,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686177076] [2021-08-27 07:50:46,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:46,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:46,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:46,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:46,582 INFO L87 Difference]: Start difference. First operand 2473 states and 3975 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:50:46,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:46,694 INFO L93 Difference]: Finished difference Result 2507 states and 3976 transitions. [2021-08-27 07:50:46,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:46,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2021-08-27 07:50:46,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:46,700 INFO L225 Difference]: With dead ends: 2507 [2021-08-27 07:50:46,701 INFO L226 Difference]: Without dead ends: 2507 [2021-08-27 07:50:46,701 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:46,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2021-08-27 07:50:46,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2505. [2021-08-27 07:50:46,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2501 states have (on average 1.5881647341063574) internal successors, (3972), 2501 states have internal predecessors, (3972), 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:50:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3975 transitions. [2021-08-27 07:50:46,733 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3975 transitions. Word has length 30 [2021-08-27 07:50:46,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:46,733 INFO L470 AbstractCegarLoop]: Abstraction has 2505 states and 3975 transitions. [2021-08-27 07:50:46,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:50:46,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3975 transitions. [2021-08-27 07:50:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 07:50:46,735 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:46,735 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, 1, 1, 1, 1] [2021-08-27 07:50:46,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 07:50:46,735 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:46,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash 165330281, now seen corresponding path program 1 times [2021-08-27 07:50:46,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:46,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718696825] [2021-08-27 07:50:46,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:46,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:46,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:46,776 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:50:46,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:46,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718696825] [2021-08-27 07:50:46,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718696825] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:46,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:46,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:46,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366443911] [2021-08-27 07:50:46,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:46,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:46,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:46,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:46,777 INFO L87 Difference]: Start difference. First operand 2505 states and 3975 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:50:46,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:46,883 INFO L93 Difference]: Finished difference Result 4491 states and 7208 transitions. [2021-08-27 07:50:46,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:46,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2021-08-27 07:50:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:46,895 INFO L225 Difference]: With dead ends: 4491 [2021-08-27 07:50:46,895 INFO L226 Difference]: Without dead ends: 4491 [2021-08-27 07:50:46,896 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2021-08-27 07:50:46,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 3593. [2021-08-27 07:50:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3589 states have (on average 1.5436054611312344) internal successors, (5540), 3589 states have internal predecessors, (5540), 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:50:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 5543 transitions. [2021-08-27 07:50:46,948 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 5543 transitions. Word has length 30 [2021-08-27 07:50:46,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:46,949 INFO L470 AbstractCegarLoop]: Abstraction has 3593 states and 5543 transitions. [2021-08-27 07:50:46,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:50:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5543 transitions. [2021-08-27 07:50:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 07:50:46,952 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:46,952 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, 1, 1, 1, 1] [2021-08-27 07:50:46,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 07:50:46,952 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:46,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:46,953 INFO L82 PathProgramCache]: Analyzing trace with hash -855738073, now seen corresponding path program 1 times [2021-08-27 07:50:46,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:46,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845098851] [2021-08-27 07:50:46,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:46,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:46,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:47,002 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:50:47,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:47,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845098851] [2021-08-27 07:50:47,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845098851] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:47,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:47,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:47,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082588022] [2021-08-27 07:50:47,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:47,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:47,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:47,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:47,004 INFO L87 Difference]: Start difference. First operand 3593 states and 5543 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:50:47,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:47,096 INFO L93 Difference]: Finished difference Result 4875 states and 7496 transitions. [2021-08-27 07:50:47,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:47,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2021-08-27 07:50:47,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:47,119 INFO L225 Difference]: With dead ends: 4875 [2021-08-27 07:50:47,120 INFO L226 Difference]: Without dead ends: 4875 [2021-08-27 07:50:47,120 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:47,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2021-08-27 07:50:47,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4873. [2021-08-27 07:50:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4873 states, 4869 states have (on average 1.538714315054426) internal successors, (7492), 4869 states have internal predecessors, (7492), 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:50:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4873 states to 4873 states and 7495 transitions. [2021-08-27 07:50:47,201 INFO L78 Accepts]: Start accepts. Automaton has 4873 states and 7495 transitions. Word has length 30 [2021-08-27 07:50:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:47,202 INFO L470 AbstractCegarLoop]: Abstraction has 4873 states and 7495 transitions. [2021-08-27 07:50:47,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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:50:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 7495 transitions. [2021-08-27 07:50:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:50:47,205 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:47,206 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, 1, 1, 1, 1, 1] [2021-08-27 07:50:47,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 07:50:47,206 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:47,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:47,206 INFO L82 PathProgramCache]: Analyzing trace with hash 830485872, now seen corresponding path program 1 times [2021-08-27 07:50:47,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:47,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455517277] [2021-08-27 07:50:47,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:47,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:47,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:47,244 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:50:47,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:47,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455517277] [2021-08-27 07:50:47,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455517277] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:47,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:47,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:47,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652953295] [2021-08-27 07:50:47,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:47,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:47,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:47,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:47,245 INFO L87 Difference]: Start difference. First operand 4873 states and 7495 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:50:47,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:47,359 INFO L93 Difference]: Finished difference Result 4939 states and 7496 transitions. [2021-08-27 07:50:47,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:47,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2021-08-27 07:50:47,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:47,376 INFO L225 Difference]: With dead ends: 4939 [2021-08-27 07:50:47,376 INFO L226 Difference]: Without dead ends: 4939 [2021-08-27 07:50:47,376 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:47,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2021-08-27 07:50:47,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4937. [2021-08-27 07:50:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4937 states, 4933 states have (on average 1.5187512669774985) internal successors, (7492), 4933 states have internal predecessors, (7492), 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:50:47,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4937 states to 4937 states and 7495 transitions. [2021-08-27 07:50:47,444 INFO L78 Accepts]: Start accepts. Automaton has 4937 states and 7495 transitions. Word has length 31 [2021-08-27 07:50:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:47,445 INFO L470 AbstractCegarLoop]: Abstraction has 4937 states and 7495 transitions. [2021-08-27 07:50:47,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:50:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 4937 states and 7495 transitions. [2021-08-27 07:50:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:50:47,449 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:47,449 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, 1, 1, 1, 1, 1] [2021-08-27 07:50:47,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 07:50:47,449 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:47,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:47,450 INFO L82 PathProgramCache]: Analyzing trace with hash -757862030, now seen corresponding path program 1 times [2021-08-27 07:50:47,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:47,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977894925] [2021-08-27 07:50:47,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:47,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:47,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:47,494 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:50:47,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:47,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977894925] [2021-08-27 07:50:47,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977894925] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:47,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:47,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:47,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935506592] [2021-08-27 07:50:47,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:47,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:47,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:47,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:47,495 INFO L87 Difference]: Start difference. First operand 4937 states and 7495 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:50:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:47,607 INFO L93 Difference]: Finished difference Result 8715 states and 13384 transitions. [2021-08-27 07:50:47,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:47,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2021-08-27 07:50:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:47,621 INFO L225 Difference]: With dead ends: 8715 [2021-08-27 07:50:47,622 INFO L226 Difference]: Without dead ends: 8715 [2021-08-27 07:50:47,622 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8715 states. [2021-08-27 07:50:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8715 to 7177. [2021-08-27 07:50:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7177 states, 7173 states have (on average 1.4727450160323434) internal successors, (10564), 7173 states have internal predecessors, (10564), 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:50:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 10567 transitions. [2021-08-27 07:50:47,707 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 10567 transitions. Word has length 31 [2021-08-27 07:50:47,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:47,707 INFO L470 AbstractCegarLoop]: Abstraction has 7177 states and 10567 transitions. [2021-08-27 07:50:47,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:50:47,708 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 10567 transitions. [2021-08-27 07:50:47,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:50:47,723 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:47,723 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, 1, 1, 1, 1, 1] [2021-08-27 07:50:47,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 07:50:47,724 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:47,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:47,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1778930384, now seen corresponding path program 1 times [2021-08-27 07:50:47,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:47,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993138962] [2021-08-27 07:50:47,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:47,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:47,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:47,753 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:50:47,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:47,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993138962] [2021-08-27 07:50:47,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993138962] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:47,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:47,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:47,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145640003] [2021-08-27 07:50:47,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:47,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:47,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:47,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:47,755 INFO L87 Difference]: Start difference. First operand 7177 states and 10567 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:50:47,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:47,863 INFO L93 Difference]: Finished difference Result 9611 states and 14088 transitions. [2021-08-27 07:50:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:47,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2021-08-27 07:50:47,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:47,876 INFO L225 Difference]: With dead ends: 9611 [2021-08-27 07:50:47,876 INFO L226 Difference]: Without dead ends: 9611 [2021-08-27 07:50:47,876 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9611 states. [2021-08-27 07:50:47,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9611 to 9609. [2021-08-27 07:50:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9609 states, 9605 states have (on average 1.4663196251952109) internal successors, (14084), 9605 states have internal predecessors, (14084), 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:50:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9609 states to 9609 states and 14087 transitions. [2021-08-27 07:50:47,997 INFO L78 Accepts]: Start accepts. Automaton has 9609 states and 14087 transitions. Word has length 31 [2021-08-27 07:50:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:47,997 INFO L470 AbstractCegarLoop]: Abstraction has 9609 states and 14087 transitions. [2021-08-27 07:50:47,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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:50:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 9609 states and 14087 transitions. [2021-08-27 07:50:48,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 07:50:48,003 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:48,003 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, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:48,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 07:50:48,004 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:48,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:48,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2018671652, now seen corresponding path program 1 times [2021-08-27 07:50:48,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:48,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205534302] [2021-08-27 07:50:48,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:48,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:48,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:48,033 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:50:48,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:48,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205534302] [2021-08-27 07:50:48,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205534302] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:48,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:48,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:48,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377538975] [2021-08-27 07:50:48,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:48,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:48,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:48,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:48,034 INFO L87 Difference]: Start difference. First operand 9609 states and 14087 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:50:48,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:48,140 INFO L93 Difference]: Finished difference Result 9739 states and 14088 transitions. [2021-08-27 07:50:48,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:48,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2021-08-27 07:50:48,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:48,153 INFO L225 Difference]: With dead ends: 9739 [2021-08-27 07:50:48,154 INFO L226 Difference]: Without dead ends: 9739 [2021-08-27 07:50:48,154 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:50:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2021-08-27 07:50:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 9737. [2021-08-27 07:50:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9737 states, 9733 states have (on average 1.4470358573923765) internal successors, (14084), 9733 states have internal predecessors, (14084), 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:50:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9737 states to 9737 states and 14087 transitions. [2021-08-27 07:50:48,295 INFO L78 Accepts]: Start accepts. Automaton has 9737 states and 14087 transitions. Word has length 32 [2021-08-27 07:50:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:48,295 INFO L470 AbstractCegarLoop]: Abstraction has 9737 states and 14087 transitions. [2021-08-27 07:50:48,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:50:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 9737 states and 14087 transitions. [2021-08-27 07:50:48,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 07:50:48,303 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:48,303 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, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:48,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 07:50:48,303 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:48,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:48,303 INFO L82 PathProgramCache]: Analyzing trace with hash 687947742, now seen corresponding path program 1 times [2021-08-27 07:50:48,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:48,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181066683] [2021-08-27 07:50:48,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:48,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:48,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:48,336 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:50:48,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:48,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181066683] [2021-08-27 07:50:48,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181066683] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:48,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:48,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:48,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229215127] [2021-08-27 07:50:48,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:48,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:48,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:48,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:48,337 INFO L87 Difference]: Start difference. First operand 9737 states and 14087 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:50:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:48,479 INFO L93 Difference]: Finished difference Result 16907 states and 24712 transitions. [2021-08-27 07:50:48,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:48,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2021-08-27 07:50:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:48,505 INFO L225 Difference]: With dead ends: 16907 [2021-08-27 07:50:48,505 INFO L226 Difference]: Without dead ends: 16907 [2021-08-27 07:50:48,505 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:48,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16907 states. [2021-08-27 07:50:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16907 to 14345. [2021-08-27 07:50:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.4015759012621156) internal successors, (20100), 14341 states have internal predecessors, (20100), 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:50:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 20103 transitions. [2021-08-27 07:50:48,728 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 20103 transitions. Word has length 32 [2021-08-27 07:50:48,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:48,728 INFO L470 AbstractCegarLoop]: Abstraction has 14345 states and 20103 transitions. [2021-08-27 07:50:48,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:50:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 20103 transitions. [2021-08-27 07:50:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 07:50:48,741 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:48,741 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, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:48,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-27 07:50:48,741 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:48,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:48,742 INFO L82 PathProgramCache]: Analyzing trace with hash -333120612, now seen corresponding path program 1 times [2021-08-27 07:50:48,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:48,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745089307] [2021-08-27 07:50:48,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:48,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:48,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:48,772 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:50:48,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:48,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745089307] [2021-08-27 07:50:48,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745089307] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:48,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:48,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:48,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026688679] [2021-08-27 07:50:48,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:48,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:48,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:48,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:48,773 INFO L87 Difference]: Start difference. First operand 14345 states and 20103 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:50:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:48,917 INFO L93 Difference]: Finished difference Result 18955 states and 26376 transitions. [2021-08-27 07:50:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:48,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2021-08-27 07:50:48,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:48,947 INFO L225 Difference]: With dead ends: 18955 [2021-08-27 07:50:48,947 INFO L226 Difference]: Without dead ends: 18955 [2021-08-27 07:50:48,947 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:48,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18955 states. [2021-08-27 07:50:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18955 to 18953. [2021-08-27 07:50:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18953 states, 18949 states have (on average 1.3917357116470526) internal successors, (26372), 18949 states have internal predecessors, (26372), 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:50:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18953 states to 18953 states and 26375 transitions. [2021-08-27 07:50:49,281 INFO L78 Accepts]: Start accepts. Automaton has 18953 states and 26375 transitions. Word has length 32 [2021-08-27 07:50:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:49,281 INFO L470 AbstractCegarLoop]: Abstraction has 18953 states and 26375 transitions. [2021-08-27 07:50:49,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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:50:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 18953 states and 26375 transitions. [2021-08-27 07:50:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 07:50:49,292 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:49,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-27 07:50:49,292 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:49,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:49,293 INFO L82 PathProgramCache]: Analyzing trace with hash -148241339, now seen corresponding path program 1 times [2021-08-27 07:50:49,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:49,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608842257] [2021-08-27 07:50:49,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:49,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:49,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:49,328 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:50:49,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:49,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608842257] [2021-08-27 07:50:49,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608842257] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:49,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:49,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:49,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892354871] [2021-08-27 07:50:49,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:49,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:49,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:49,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:49,330 INFO L87 Difference]: Start difference. First operand 18953 states and 26375 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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:50:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:49,451 INFO L93 Difference]: Finished difference Result 19211 states and 26376 transitions. [2021-08-27 07:50:49,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:49,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 33 [2021-08-27 07:50:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:49,477 INFO L225 Difference]: With dead ends: 19211 [2021-08-27 07:50:49,477 INFO L226 Difference]: Without dead ends: 19211 [2021-08-27 07:50:49,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:49,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19211 states. [2021-08-27 07:50:49,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19211 to 19209. [2021-08-27 07:50:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19209 states, 19205 states have (on average 1.37318406664931) internal successors, (26372), 19205 states have internal predecessors, (26372), 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:50:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19209 states to 19209 states and 26375 transitions. [2021-08-27 07:50:49,730 INFO L78 Accepts]: Start accepts. Automaton has 19209 states and 26375 transitions. Word has length 33 [2021-08-27 07:50:49,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:49,730 INFO L470 AbstractCegarLoop]: Abstraction has 19209 states and 26375 transitions. [2021-08-27 07:50:49,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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:50:49,731 INFO L276 IsEmpty]: Start isEmpty. Operand 19209 states and 26375 transitions. [2021-08-27 07:50:49,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 07:50:49,742 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:49,742 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:49,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-27 07:50:49,743 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:49,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:49,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1736589241, now seen corresponding path program 1 times [2021-08-27 07:50:49,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:49,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538900366] [2021-08-27 07:50:49,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:49,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:49,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:49,779 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:50:49,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:49,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538900366] [2021-08-27 07:50:49,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538900366] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:49,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:49,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:49,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907698767] [2021-08-27 07:50:49,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:49,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:49,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:49,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:49,781 INFO L87 Difference]: Start difference. First operand 19209 states and 26375 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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:50:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:50,046 INFO L93 Difference]: Finished difference Result 37387 states and 49672 transitions. [2021-08-27 07:50:50,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:50,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 33 [2021-08-27 07:50:50,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:50,097 INFO L225 Difference]: With dead ends: 37387 [2021-08-27 07:50:50,097 INFO L226 Difference]: Without dead ends: 37387 [2021-08-27 07:50:50,097 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37387 states. [2021-08-27 07:50:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37387 to 37385. [2021-08-27 07:50:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37385 states, 37381 states have (on average 1.3286963965651) internal successors, (49668), 37381 states have internal predecessors, (49668), 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:50:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37385 states to 37385 states and 49671 transitions. [2021-08-27 07:50:50,491 INFO L78 Accepts]: Start accepts. Automaton has 37385 states and 49671 transitions. Word has length 33 [2021-08-27 07:50:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:50,491 INFO L470 AbstractCegarLoop]: Abstraction has 37385 states and 49671 transitions. [2021-08-27 07:50:50,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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:50:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 37385 states and 49671 transitions. [2021-08-27 07:50:50,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 07:50:50,508 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:50,508 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:50,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-27 07:50:50,508 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:50,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:50,509 INFO L82 PathProgramCache]: Analyzing trace with hash -715520887, now seen corresponding path program 1 times [2021-08-27 07:50:50,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:50,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129715517] [2021-08-27 07:50:50,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:50,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:50,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:50,539 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:50:50,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:50,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129715517] [2021-08-27 07:50:50,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129715517] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:50,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:50,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:50,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398211596] [2021-08-27 07:50:50,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:50,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:50,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:50,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:50,541 INFO L87 Difference]: Start difference. First operand 37385 states and 49671 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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:50:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:50,700 INFO L93 Difference]: Finished difference Result 41483 states and 56328 transitions. [2021-08-27 07:50:50,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:50,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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 33 [2021-08-27 07:50:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:50,750 INFO L225 Difference]: With dead ends: 41483 [2021-08-27 07:50:50,750 INFO L226 Difference]: Without dead ends: 41483 [2021-08-27 07:50:50,751 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41483 states. [2021-08-27 07:50:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41483 to 37385. [2021-08-27 07:50:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37385 states, 37381 states have (on average 1.3149995987266259) internal successors, (49156), 37381 states have internal predecessors, (49156), 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:50:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37385 states to 37385 states and 49159 transitions. [2021-08-27 07:50:51,413 INFO L78 Accepts]: Start accepts. Automaton has 37385 states and 49159 transitions. Word has length 33 [2021-08-27 07:50:51,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:51,413 INFO L470 AbstractCegarLoop]: Abstraction has 37385 states and 49159 transitions. [2021-08-27 07:50:51,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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:50:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 37385 states and 49159 transitions. [2021-08-27 07:50:51,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-27 07:50:51,431 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:51,431 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:51,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 07:50:51,431 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:51,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:51,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2000523857, now seen corresponding path program 1 times [2021-08-27 07:50:51,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:51,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556014350] [2021-08-27 07:50:51,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:51,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:51,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:51,466 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:50:51,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:51,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556014350] [2021-08-27 07:50:51,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556014350] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:51,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:51,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:51,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992829401] [2021-08-27 07:50:51,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:51,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:51,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:51,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:51,468 INFO L87 Difference]: Start difference. First operand 37385 states and 49159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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:50:51,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:51,779 INFO L93 Difference]: Finished difference Result 62987 states and 82952 transitions. [2021-08-27 07:50:51,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:51,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 34 [2021-08-27 07:50:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:51,873 INFO L225 Difference]: With dead ends: 62987 [2021-08-27 07:50:51,874 INFO L226 Difference]: Without dead ends: 62987 [2021-08-27 07:50:51,875 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:51,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62987 states. [2021-08-27 07:50:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62987 to 56841. [2021-08-27 07:50:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56841 states, 56837 states have (on average 1.2792371166669598) internal successors, (72708), 56837 states have internal predecessors, (72708), 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:50:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56841 states to 56841 states and 72711 transitions. [2021-08-27 07:50:52,642 INFO L78 Accepts]: Start accepts. Automaton has 56841 states and 72711 transitions. Word has length 34 [2021-08-27 07:50:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:52,642 INFO L470 AbstractCegarLoop]: Abstraction has 56841 states and 72711 transitions. [2021-08-27 07:50:52,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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:50:52,642 INFO L276 IsEmpty]: Start isEmpty. Operand 56841 states and 72711 transitions. [2021-08-27 07:50:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-27 07:50:52,673 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:52,673 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:52,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-27 07:50:52,674 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:52,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:52,674 INFO L82 PathProgramCache]: Analyzing trace with hash 979455503, now seen corresponding path program 1 times [2021-08-27 07:50:52,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:52,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269569565] [2021-08-27 07:50:52,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:52,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:52,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:52,704 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:50:52,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:52,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269569565] [2021-08-27 07:50:52,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269569565] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:52,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:52,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:52,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894470992] [2021-08-27 07:50:52,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:52,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:52,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:52,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:52,706 INFO L87 Difference]: Start difference. First operand 56841 states and 72711 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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:50:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:53,039 INFO L93 Difference]: Finished difference Result 73227 states and 92168 transitions. [2021-08-27 07:50:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:53,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 34 [2021-08-27 07:50:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:53,117 INFO L225 Difference]: With dead ends: 73227 [2021-08-27 07:50:53,118 INFO L226 Difference]: Without dead ends: 73227 [2021-08-27 07:50:53,118 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73227 states. [2021-08-27 07:50:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73227 to 73225. [2021-08-27 07:50:53,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73225 states, 73221 states have (on average 1.258709932942735) internal successors, (92164), 73221 states have internal predecessors, (92164), 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:50:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73225 states to 73225 states and 92167 transitions. [2021-08-27 07:50:53,877 INFO L78 Accepts]: Start accepts. Automaton has 73225 states and 92167 transitions. Word has length 34 [2021-08-27 07:50:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:53,877 INFO L470 AbstractCegarLoop]: Abstraction has 73225 states and 92167 transitions. [2021-08-27 07:50:53,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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:50:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 73225 states and 92167 transitions. [2021-08-27 07:50:54,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 07:50:54,061 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:54,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:54,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-27 07:50:54,062 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:54,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:54,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1886913244, now seen corresponding path program 1 times [2021-08-27 07:50:54,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:54,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745392588] [2021-08-27 07:50:54,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:54,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:54,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:54,111 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:50:54,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:54,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745392588] [2021-08-27 07:50:54,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745392588] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:54,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:54,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:54,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516879343] [2021-08-27 07:50:54,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:54,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:54,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:54,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:54,113 INFO L87 Difference]: Start difference. First operand 73225 states and 92167 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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:50:54,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:54,351 INFO L93 Difference]: Finished difference Result 74763 states and 93192 transitions. [2021-08-27 07:50:54,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:54,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 35 [2021-08-27 07:50:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:54,432 INFO L225 Difference]: With dead ends: 74763 [2021-08-27 07:50:54,432 INFO L226 Difference]: Without dead ends: 74763 [2021-08-27 07:50:54,432 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:54,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74763 states. [2021-08-27 07:50:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74763 to 74761. [2021-08-27 07:50:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74761 states, 74757 states have (on average 1.2465454740024347) internal successors, (93188), 74757 states have internal predecessors, (93188), 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:50:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74761 states to 74761 states and 93191 transitions. [2021-08-27 07:50:55,390 INFO L78 Accepts]: Start accepts. Automaton has 74761 states and 93191 transitions. Word has length 35 [2021-08-27 07:50:55,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:55,391 INFO L470 AbstractCegarLoop]: Abstraction has 74761 states and 93191 transitions. [2021-08-27 07:50:55,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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:50:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 74761 states and 93191 transitions. [2021-08-27 07:50:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 07:50:55,425 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:55,426 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:55,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-27 07:50:55,426 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:55,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:55,426 INFO L82 PathProgramCache]: Analyzing trace with hash 298565342, now seen corresponding path program 1 times [2021-08-27 07:50:55,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:55,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092656885] [2021-08-27 07:50:55,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:55,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:55,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:55,475 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:50:55,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:55,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092656885] [2021-08-27 07:50:55,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092656885] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:55,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:55,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:55,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939633892] [2021-08-27 07:50:55,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:55,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:55,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:55,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:55,477 INFO L87 Difference]: Start difference. First operand 74761 states and 93191 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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:50:55,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:55,858 INFO L93 Difference]: Finished difference Result 122891 states and 151560 transitions. [2021-08-27 07:50:55,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:55,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 35 [2021-08-27 07:50:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:56,021 INFO L225 Difference]: With dead ends: 122891 [2021-08-27 07:50:56,021 INFO L226 Difference]: Without dead ends: 122891 [2021-08-27 07:50:56,023 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122891 states. [2021-08-27 07:50:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122891 to 114697. [2021-08-27 07:50:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114697 states, 114693 states have (on average 1.2142676536493073) internal successors, (139268), 114693 states have internal predecessors, (139268), 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:50:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114697 states to 114697 states and 139271 transitions. [2021-08-27 07:50:57,410 INFO L78 Accepts]: Start accepts. Automaton has 114697 states and 139271 transitions. Word has length 35 [2021-08-27 07:50:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:57,410 INFO L470 AbstractCegarLoop]: Abstraction has 114697 states and 139271 transitions. [2021-08-27 07:50:57,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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:50:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 114697 states and 139271 transitions. [2021-08-27 07:50:57,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 07:50:57,470 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:57,470 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:57,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-27 07:50:57,471 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:57,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:57,471 INFO L82 PathProgramCache]: Analyzing trace with hash -722503012, now seen corresponding path program 1 times [2021-08-27 07:50:57,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:57,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872614279] [2021-08-27 07:50:57,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:57,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:57,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:57,502 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:50:57,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:57,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872614279] [2021-08-27 07:50:57,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872614279] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:57,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:57,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:57,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414825618] [2021-08-27 07:50:57,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:57,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:57,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:57,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:57,504 INFO L87 Difference]: Start difference. First operand 114697 states and 139271 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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:50:58,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:58,121 INFO L93 Difference]: Finished difference Result 145419 states and 172040 transitions. [2021-08-27 07:50:58,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:58,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 35 [2021-08-27 07:50:58,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:58,281 INFO L225 Difference]: With dead ends: 145419 [2021-08-27 07:50:58,282 INFO L226 Difference]: Without dead ends: 145419 [2021-08-27 07:50:58,282 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:50:58,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145419 states. [2021-08-27 07:50:59,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145419 to 145417. [2021-08-27 07:50:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145417 states, 145413 states have (on average 1.1830854187727369) internal successors, (172036), 145413 states have internal predecessors, (172036), 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:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145417 states to 145417 states and 172039 transitions. [2021-08-27 07:51:00,084 INFO L78 Accepts]: Start accepts. Automaton has 145417 states and 172039 transitions. Word has length 35 [2021-08-27 07:51:00,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:00,084 INFO L470 AbstractCegarLoop]: Abstraction has 145417 states and 172039 transitions. [2021-08-27 07:51:00,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 145417 states and 172039 transitions. [2021-08-27 07:51:00,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 07:51:00,147 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:00,147 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:00,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-27 07:51:00,147 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:00,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:00,148 INFO L82 PathProgramCache]: Analyzing trace with hash 665807172, now seen corresponding path program 1 times [2021-08-27 07:51:00,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:00,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998185179] [2021-08-27 07:51:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:00,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:00,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:00,193 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:00,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:00,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998185179] [2021-08-27 07:51:00,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998185179] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:00,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:00,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:00,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188353958] [2021-08-27 07:51:00,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:00,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:00,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:00,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:00,195 INFO L87 Difference]: Start difference. First operand 145417 states and 172039 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:01,026 INFO L93 Difference]: Finished difference Result 147467 states and 172040 transitions. [2021-08-27 07:51:01,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:01,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 36 [2021-08-27 07:51:01,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:01,237 INFO L225 Difference]: With dead ends: 147467 [2021-08-27 07:51:01,238 INFO L226 Difference]: Without dead ends: 147467 [2021-08-27 07:51:01,238 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147467 states. [2021-08-27 07:51:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147467 to 147465. [2021-08-27 07:51:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147465 states, 147461 states have (on average 1.1666542340008546) internal successors, (172036), 147461 states have internal predecessors, (172036), 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:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147465 states to 147465 states and 172039 transitions. [2021-08-27 07:51:02,951 INFO L78 Accepts]: Start accepts. Automaton has 147465 states and 172039 transitions. Word has length 36 [2021-08-27 07:51:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:02,951 INFO L470 AbstractCegarLoop]: Abstraction has 147465 states and 172039 transitions. [2021-08-27 07:51:02,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 147465 states and 172039 transitions. [2021-08-27 07:51:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 07:51:03,042 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:03,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:03,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-27 07:51:03,042 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:03,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:03,043 INFO L82 PathProgramCache]: Analyzing trace with hash -922540730, now seen corresponding path program 1 times [2021-08-27 07:51:03,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:03,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606809497] [2021-08-27 07:51:03,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:03,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:03,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:03,098 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:03,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:03,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606809497] [2021-08-27 07:51:03,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606809497] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:03,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:03,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:03,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359166128] [2021-08-27 07:51:03,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:03,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:03,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:03,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:03,100 INFO L87 Difference]: Start difference. First operand 147465 states and 172039 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:03,748 INFO L93 Difference]: Finished difference Result 237577 states and 270343 transitions. [2021-08-27 07:51:03,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:03,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 36 [2021-08-27 07:51:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:04,068 INFO L225 Difference]: With dead ends: 237577 [2021-08-27 07:51:04,068 INFO L226 Difference]: Without dead ends: 237577 [2021-08-27 07:51:04,068 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237577 states. [2021-08-27 07:51:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237577 to 229385. [2021-08-27 07:51:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229385 states, 229381 states have (on average 1.1428496693274508) internal successors, (262148), 229381 states have internal predecessors, (262148), 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:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229385 states to 229385 states and 262151 transitions. [2021-08-27 07:51:06,901 INFO L78 Accepts]: Start accepts. Automaton has 229385 states and 262151 transitions. Word has length 36 [2021-08-27 07:51:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:06,901 INFO L470 AbstractCegarLoop]: Abstraction has 229385 states and 262151 transitions. [2021-08-27 07:51:06,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 229385 states and 262151 transitions. [2021-08-27 07:51:07,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 07:51:07,071 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:07,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:07,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-27 07:51:07,071 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:07,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:07,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1943609084, now seen corresponding path program 1 times [2021-08-27 07:51:07,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:07,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325133810] [2021-08-27 07:51:07,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:07,072 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:07,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:07,117 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:07,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:07,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325133810] [2021-08-27 07:51:07,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325133810] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:07,118 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:07,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:07,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583125996] [2021-08-27 07:51:07,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:07,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:07,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:07,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:07,119 INFO L87 Difference]: Start difference. First operand 229385 states and 262151 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:08,402 INFO L93 Difference]: Finished difference Result 286727 states and 315398 transitions. [2021-08-27 07:51:08,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:08,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 36 [2021-08-27 07:51:08,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:08,403 INFO L225 Difference]: With dead ends: 286727 [2021-08-27 07:51:08,403 INFO L226 Difference]: Without dead ends: 0 [2021-08-27 07:51:08,403 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-27 07:51:08,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-27 07:51:08,404 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:08,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 07:51:08,404 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2021-08-27 07:51:08,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:08,404 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 07:51:08,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-27 07:51:08,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-27 07:51:08,406 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 07:51:08,407 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 07:51:08,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-27 07:51:08,410 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 07:51:08,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 07:51:08 BoogieIcfgContainer [2021-08-27 07:51:08,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 07:51:08,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 07:51:08,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 07:51:08,412 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 07:51:08,412 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:50:42" (3/4) ... [2021-08-27 07:51:08,414 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-27 07:51:08,418 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-08-27 07:51:08,419 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-08-27 07:51:08,419 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-08-27 07:51:08,423 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-08-27 07:51:08,423 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-27 07:51:08,423 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-27 07:51:08,423 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-27 07:51:08,459 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 07:51:08,460 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 07:51:08,461 INFO L168 Benchmark]: Toolchain (without parser) took 26573.31 ms. Allocated memory was 56.6 MB in the beginning and 14.3 GB in the end (delta: 14.3 GB). Free memory was 35.6 MB in the beginning and 11.4 GB in the end (delta: -11.4 GB). Peak memory consumption was 2.9 GB. Max. memory is 16.1 GB. [2021-08-27 07:51:08,462 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 56.6 MB. Free memory was 38.8 MB in the beginning and 38.7 MB in the end (delta: 44.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:51:08,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.99 ms. Allocated memory is still 56.6 MB. Free memory was 35.4 MB in the beginning and 39.6 MB in the end (delta: -4.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 07:51:08,462 INFO L168 Benchmark]: Boogie Preprocessor took 38.85 ms. Allocated memory is still 56.6 MB. Free memory was 39.6 MB in the beginning and 37.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 07:51:08,463 INFO L168 Benchmark]: RCFGBuilder took 526.56 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 37.7 MB in the beginning and 44.0 MB in the end (delta: -6.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. [2021-08-27 07:51:08,463 INFO L168 Benchmark]: TraceAbstraction took 25701.09 ms. Allocated memory was 73.4 MB in the beginning and 14.3 GB in the end (delta: 14.3 GB). Free memory was 43.5 MB in the beginning and 11.4 GB in the end (delta: -11.4 GB). Peak memory consumption was 2.9 GB. Max. memory is 16.1 GB. [2021-08-27 07:51:08,463 INFO L168 Benchmark]: Witness Printer took 48.03 ms. Allocated memory is still 14.3 GB. Free memory was 11.4 GB in the beginning and 11.4 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 07:51:08,466 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.19 ms. Allocated memory is still 56.6 MB. Free memory was 38.8 MB in the beginning and 38.7 MB in the end (delta: 44.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 253.99 ms. Allocated memory is still 56.6 MB. Free memory was 35.4 MB in the beginning and 39.6 MB in the end (delta: -4.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.85 ms. Allocated memory is still 56.6 MB. Free memory was 39.6 MB in the beginning and 37.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 526.56 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 37.7 MB in the beginning and 44.0 MB in the end (delta: -6.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 25701.09 ms. Allocated memory was 73.4 MB in the beginning and 14.3 GB in the end (delta: 14.3 GB). Free memory was 43.5 MB in the beginning and 11.4 GB in the end (delta: -11.4 GB). Peak memory consumption was 2.9 GB. Max. memory is 16.1 GB. * Witness Printer took 48.03 ms. Allocated memory is still 14.3 GB. Free memory was 11.4 GB in the beginning and 11.4 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 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: 205]: 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, 58 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 25666.3ms, OverallIterations: 37, TraceHistogramMax: 1, EmptinessCheckTime: 772.7ms, AutomataDifference: 9890.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3994 SDtfs, 6007 SDslu, 219 SDs, 0 SdLazy, 2828 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2521.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1340.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=229385occurred in iteration=36, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 12915.9ms AutomataMinimizationTime, 37 MinimizatonAttempts, 32806 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 53.9ms SsaConstructionTime, 178.0ms SatisfiabilityAnalysisTime, 1549.1ms InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1095 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1058 ConstructedInterpolants, 0 QuantifiedInterpolants, 3260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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:08,510 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...