./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_10.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_10.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 6423b7e5fbcc52c08e52aff49c79db620dd407c4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:20,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 07:50:20,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 07:50:20,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 07:50:20,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 07:50:20,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 07:50:20,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 07:50:20,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 07:50:20,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 07:50:20,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 07:50:20,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 07:50:20,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 07:50:20,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 07:50:20,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 07:50:20,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 07:50:20,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 07:50:20,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 07:50:20,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 07:50:20,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 07:50:20,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 07:50:20,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 07:50:20,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 07:50:20,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 07:50:20,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 07:50:20,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 07:50:20,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 07:50:20,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 07:50:20,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 07:50:20,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 07:50:20,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 07:50:20,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 07:50:20,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 07:50:20,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 07:50:20,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 07:50:20,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 07:50:20,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 07:50:20,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 07:50:20,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 07:50:20,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 07:50:20,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 07:50:20,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 07:50:20,316 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:20,353 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 07:50:20,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 07:50:20,354 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 07:50:20,355 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 07:50:20,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 07:50:20,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 07:50:20,357 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 07:50:20,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 07:50:20,358 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 07:50:20,358 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 07:50:20,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 07:50:20,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 07:50:20,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 07:50:20,359 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 07:50:20,360 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 07:50:20,360 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 07:50:20,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 07:50:20,369 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 07:50:20,369 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 07:50:20,369 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 07:50:20,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 07:50:20,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 07:50:20,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 07:50:20,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:50:20,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 07:50:20,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 07:50:20,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 07:50:20,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 07:50:20,371 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 07:50:20,371 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 -> 6423b7e5fbcc52c08e52aff49c79db620dd407c4 [2021-08-27 07:50:20,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 07:50:20,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 07:50:20,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 07:50:20,742 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 07:50:20,743 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 07:50:20,743 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2021-08-27 07:50:20,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7395b9e8/ffdfaf284b61412082850226cf5336ef/FLAG868c0c31a [2021-08-27 07:50:21,161 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 07:50:21,162 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2021-08-27 07:50:21,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7395b9e8/ffdfaf284b61412082850226cf5336ef/FLAG868c0c31a [2021-08-27 07:50:21,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7395b9e8/ffdfaf284b61412082850226cf5336ef [2021-08-27 07:50:21,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 07:50:21,187 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 07:50:21,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 07:50:21,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 07:50:21,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 07:50:21,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:50:21" (1/1) ... [2021-08-27 07:50:21,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca8ccee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:21, skipping insertion in model container [2021-08-27 07:50:21,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:50:21" (1/1) ... [2021-08-27 07:50:21,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 07:50:21,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 07:50:21,398 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_10.c[3901,3914] [2021-08-27 07:50:21,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:50:21,461 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 07:50:21,499 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_10.c[3901,3914] [2021-08-27 07:50:21,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:50:21,515 INFO L208 MainTranslator]: Completed translation [2021-08-27 07:50:21,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:21 WrapperNode [2021-08-27 07:50:21,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 07:50:21,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 07:50:21,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 07:50:21,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 07:50:21,528 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:21" (1/1) ... [2021-08-27 07:50:21,529 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:21" (1/1) ... [2021-08-27 07:50:21,545 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:21" (1/1) ... [2021-08-27 07:50:21,545 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:21" (1/1) ... [2021-08-27 07:50:21,558 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:21" (1/1) ... [2021-08-27 07:50:21,565 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:21" (1/1) ... [2021-08-27 07:50:21,569 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:21" (1/1) ... [2021-08-27 07:50:21,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 07:50:21,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 07:50:21,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 07:50:21,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 07:50:21,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:21" (1/1) ... [2021-08-27 07:50:21,585 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:50:21,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:50:21,614 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:21,653 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:21,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 07:50:21,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 07:50:21,665 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 07:50:21,666 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 07:50:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 07:50:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 07:50:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 07:50:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 07:50:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 07:50:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 07:50:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 07:50:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 07:50:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 07:50:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 07:50:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 07:50:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 07:50:22,113 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 07:50:22,113 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-08-27 07:50:22,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:50:22 BoogieIcfgContainer [2021-08-27 07:50:22,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 07:50:22,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 07:50:22,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 07:50:22,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 07:50:22,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 07:50:21" (1/3) ... [2021-08-27 07:50:22,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254013f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:50:22, skipping insertion in model container [2021-08-27 07:50:22,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:21" (2/3) ... [2021-08-27 07:50:22,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254013f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:50:22, skipping insertion in model container [2021-08-27 07:50:22,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:50:22" (3/3) ... [2021-08-27 07:50:22,123 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2021-08-27 07:50:22,127 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 07:50:22,128 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-27 07:50:22,164 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 07:50:22,170 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:22,170 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-27 07:50:22,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 41 states have internal predecessors, (74), 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:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 07:50:22,188 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:22,189 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:22,189 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr1ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:22,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:22,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1705512569, now seen corresponding path program 1 times [2021-08-27 07:50:22,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:22,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548152125] [2021-08-27 07:50:22,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:22,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,408 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:22,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:22,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548152125] [2021-08-27 07:50:22,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548152125] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:22,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:22,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 07:50:22,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166102729] [2021-08-27 07:50:22,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 07:50:22,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:22,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 07:50:22,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:22,428 INFO L87 Difference]: Start difference. First operand has 46 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 41 states have internal predecessors, (74), 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:22,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:22,477 INFO L93 Difference]: Finished difference Result 45 states and 74 transitions. [2021-08-27 07:50:22,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:50:22,480 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:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:22,487 INFO L225 Difference]: With dead ends: 45 [2021-08-27 07:50:22,488 INFO L226 Difference]: Without dead ends: 40 [2021-08-27 07:50:22,489 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-08-27 07:50:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-08-27 07:50:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 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:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 69 transitions. [2021-08-27 07:50:22,514 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 69 transitions. Word has length 9 [2021-08-27 07:50:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:22,514 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 69 transitions. [2021-08-27 07:50:22,514 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:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 69 transitions. [2021-08-27 07:50:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 07:50:22,515 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:22,515 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:22,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 07:50:22,516 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:22,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:22,516 INFO L82 PathProgramCache]: Analyzing trace with hash -897937924, now seen corresponding path program 1 times [2021-08-27 07:50:22,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:22,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181858063] [2021-08-27 07:50:22,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:22,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,649 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:22,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:22,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181858063] [2021-08-27 07:50:22,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181858063] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:22,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:22,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:22,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705566339] [2021-08-27 07:50:22,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:22,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:22,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:22,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:22,653 INFO L87 Difference]: Start difference. First operand 40 states and 69 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:22,950 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2021-08-27 07:50:22,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:22,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 07:50:22,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:22,954 INFO L225 Difference]: With dead ends: 73 [2021-08-27 07:50:22,954 INFO L226 Difference]: Without dead ends: 73 [2021-08-27 07:50:22,955 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 89.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-08-27 07:50:22,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2021-08-27 07:50:22,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 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:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2021-08-27 07:50:22,971 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2021-08-27 07:50:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:22,971 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2021-08-27 07:50:22,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2021-08-27 07:50:22,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 07:50:22,973 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:22,973 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:22,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 07:50:22,973 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:22,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:22,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1484743938, now seen corresponding path program 1 times [2021-08-27 07:50:22,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:22,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037629186] [2021-08-27 07:50:22,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:22,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,136 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:23,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:23,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037629186] [2021-08-27 07:50:23,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037629186] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:23,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:23,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:23,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364749828] [2021-08-27 07:50:23,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:23,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:23,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:23,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:23,143 INFO L87 Difference]: Start difference. First operand 51 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:23,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:23,399 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2021-08-27 07:50:23,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:23,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 07:50:23,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:23,401 INFO L225 Difference]: With dead ends: 73 [2021-08-27 07:50:23,401 INFO L226 Difference]: Without dead ends: 73 [2021-08-27 07:50:23,402 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 89.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:23,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-08-27 07:50:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2021-08-27 07:50:23,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 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:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 126 transitions. [2021-08-27 07:50:23,409 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 126 transitions. Word has length 21 [2021-08-27 07:50:23,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:23,409 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 126 transitions. [2021-08-27 07:50:23,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 126 transitions. [2021-08-27 07:50:23,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 07:50:23,410 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:23,410 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:23,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 07:50:23,411 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:23,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:23,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2066058485, now seen corresponding path program 1 times [2021-08-27 07:50:23,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:23,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490972549] [2021-08-27 07:50:23,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:23,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,495 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:23,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:23,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490972549] [2021-08-27 07:50:23,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490972549] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:23,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:23,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:23,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046327151] [2021-08-27 07:50:23,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:23,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:23,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:23,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:23,498 INFO L87 Difference]: Start difference. First operand 71 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:23,713 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2021-08-27 07:50:23,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:23,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 07:50:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:23,717 INFO L225 Difference]: With dead ends: 76 [2021-08-27 07:50:23,718 INFO L226 Difference]: Without dead ends: 76 [2021-08-27 07:50:23,718 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 76.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:23,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-08-27 07:50:23,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2021-08-27 07:50:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 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:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 128 transitions. [2021-08-27 07:50:23,736 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 128 transitions. Word has length 22 [2021-08-27 07:50:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:23,736 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 128 transitions. [2021-08-27 07:50:23,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2021-08-27 07:50:23,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 07:50:23,738 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:23,738 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:23,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 07:50:23,739 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:23,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:23,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1217791561, now seen corresponding path program 1 times [2021-08-27 07:50:23,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:23,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890014297] [2021-08-27 07:50:23,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:23,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,846 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:23,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:23,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890014297] [2021-08-27 07:50:23,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890014297] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:23,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:23,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:23,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015225072] [2021-08-27 07:50:23,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:23,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:23,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:23,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:23,849 INFO L87 Difference]: Start difference. First operand 74 states and 128 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:24,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:24,025 INFO L93 Difference]: Finished difference Result 137 states and 238 transitions. [2021-08-27 07:50:24,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:24,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 07:50:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:24,026 INFO L225 Difference]: With dead ends: 137 [2021-08-27 07:50:24,027 INFO L226 Difference]: Without dead ends: 137 [2021-08-27 07:50:24,027 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 81.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:24,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-08-27 07:50:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2021-08-27 07:50:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 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:24,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 237 transitions. [2021-08-27 07:50:24,032 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 237 transitions. Word has length 22 [2021-08-27 07:50:24,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:24,032 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 237 transitions. [2021-08-27 07:50:24,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:24,033 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 237 transitions. [2021-08-27 07:50:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 07:50:24,033 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:24,033 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:24,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 07:50:24,034 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:24,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1804597575, now seen corresponding path program 1 times [2021-08-27 07:50:24,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:24,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340883525] [2021-08-27 07:50:24,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:24,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,085 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:24,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:24,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340883525] [2021-08-27 07:50:24,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340883525] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:24,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:24,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:24,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053811885] [2021-08-27 07:50:24,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:24,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:24,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:24,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:24,087 INFO L87 Difference]: Start difference. First operand 135 states and 237 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:24,215 INFO L93 Difference]: Finished difference Result 173 states and 304 transitions. [2021-08-27 07:50:24,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:24,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 07:50:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:24,217 INFO L225 Difference]: With dead ends: 173 [2021-08-27 07:50:24,217 INFO L226 Difference]: Without dead ends: 173 [2021-08-27 07:50:24,217 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-08-27 07:50:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 135. [2021-08-27 07:50:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 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:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 235 transitions. [2021-08-27 07:50:24,222 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 235 transitions. Word has length 22 [2021-08-27 07:50:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:24,222 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 235 transitions. [2021-08-27 07:50:24,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 235 transitions. [2021-08-27 07:50:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 07:50:24,224 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:24,224 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:24,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 07:50:24,224 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:24,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:24,225 INFO L82 PathProgramCache]: Analyzing trace with hash -902953549, now seen corresponding path program 1 times [2021-08-27 07:50:24,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:24,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290592019] [2021-08-27 07:50:24,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:24,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,310 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:24,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:24,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290592019] [2021-08-27 07:50:24,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290592019] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:24,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:24,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:24,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585492391] [2021-08-27 07:50:24,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:24,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:24,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:24,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:24,312 INFO L87 Difference]: Start difference. First operand 135 states and 235 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:24,469 INFO L93 Difference]: Finished difference Result 249 states and 438 transitions. [2021-08-27 07:50:24,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:24,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 07:50:24,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:24,471 INFO L225 Difference]: With dead ends: 249 [2021-08-27 07:50:24,471 INFO L226 Difference]: Without dead ends: 249 [2021-08-27 07:50:24,472 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:24,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-08-27 07:50:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 183. [2021-08-27 07:50:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 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:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 317 transitions. [2021-08-27 07:50:24,486 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 317 transitions. Word has length 23 [2021-08-27 07:50:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:24,488 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 317 transitions. [2021-08-27 07:50:24,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 317 transitions. [2021-08-27 07:50:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 07:50:24,497 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:24,497 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:24,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 07:50:24,497 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:24,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:24,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1489759563, now seen corresponding path program 1 times [2021-08-27 07:50:24,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:24,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963913051] [2021-08-27 07:50:24,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:24,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,579 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:24,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:24,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963913051] [2021-08-27 07:50:24,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963913051] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:24,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:24,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:24,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896036882] [2021-08-27 07:50:24,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:24,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:24,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:24,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:24,581 INFO L87 Difference]: Start difference. First operand 183 states and 317 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:24,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:24,699 INFO L93 Difference]: Finished difference Result 257 states and 440 transitions. [2021-08-27 07:50:24,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:24,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 07:50:24,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:24,701 INFO L225 Difference]: With dead ends: 257 [2021-08-27 07:50:24,701 INFO L226 Difference]: Without dead ends: 257 [2021-08-27 07:50:24,701 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:24,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-08-27 07:50:24,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2021-08-27 07:50:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 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:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 439 transitions. [2021-08-27 07:50:24,707 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 439 transitions. Word has length 23 [2021-08-27 07:50:24,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:24,707 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 439 transitions. [2021-08-27 07:50:24,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 439 transitions. [2021-08-27 07:50:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 07:50:24,708 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:24,708 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:24,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 07:50:24,709 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:24,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:24,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2073425118, now seen corresponding path program 1 times [2021-08-27 07:50:24,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:24,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414268255] [2021-08-27 07:50:24,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:24,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,754 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:24,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:24,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414268255] [2021-08-27 07:50:24,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414268255] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:24,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:24,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:24,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737529553] [2021-08-27 07:50:24,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:24,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:24,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:24,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:24,756 INFO L87 Difference]: Start difference. First operand 255 states and 439 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:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:24,861 INFO L93 Difference]: Finished difference Result 263 states and 444 transitions. [2021-08-27 07:50:24,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:24,862 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:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:24,863 INFO L225 Difference]: With dead ends: 263 [2021-08-27 07:50:24,863 INFO L226 Difference]: Without dead ends: 263 [2021-08-27 07:50:24,863 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:24,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-08-27 07:50:24,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2021-08-27 07:50:24,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 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:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 443 transitions. [2021-08-27 07:50:24,869 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 443 transitions. Word has length 24 [2021-08-27 07:50:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:24,869 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 443 transitions. [2021-08-27 07:50:24,869 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:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 443 transitions. [2021-08-27 07:50:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 07:50:24,870 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:24,870 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:24,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 07:50:24,870 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:24,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:24,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1062307868, now seen corresponding path program 1 times [2021-08-27 07:50:24,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:24,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106148854] [2021-08-27 07:50:24,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:24,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,922 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:24,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:24,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106148854] [2021-08-27 07:50:24,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106148854] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:24,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:24,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:24,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739568917] [2021-08-27 07:50:24,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:24,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:24,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:24,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:24,924 INFO L87 Difference]: Start difference. First operand 261 states and 443 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:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:25,053 INFO L93 Difference]: Finished difference Result 475 states and 812 transitions. [2021-08-27 07:50:25,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:25,054 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:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:25,056 INFO L225 Difference]: With dead ends: 475 [2021-08-27 07:50:25,056 INFO L226 Difference]: Without dead ends: 475 [2021-08-27 07:50:25,056 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:25,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2021-08-27 07:50:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 361. [2021-08-27 07:50:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 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:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 603 transitions. [2021-08-27 07:50:25,063 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 603 transitions. Word has length 24 [2021-08-27 07:50:25,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:25,064 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 603 transitions. [2021-08-27 07:50:25,064 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:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 603 transitions. [2021-08-27 07:50:25,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 07:50:25,065 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:25,065 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:25,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 07:50:25,065 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:25,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:25,066 INFO L82 PathProgramCache]: Analyzing trace with hash 475501854, now seen corresponding path program 1 times [2021-08-27 07:50:25,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:25,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537486296] [2021-08-27 07:50:25,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:25,066 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,126 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:25,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:25,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537486296] [2021-08-27 07:50:25,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537486296] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:25,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:25,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:25,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750973047] [2021-08-27 07:50:25,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:25,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:25,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:25,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:25,128 INFO L87 Difference]: Start difference. First operand 361 states and 603 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:25,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:25,260 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2021-08-27 07:50:25,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:25,261 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:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:25,266 INFO L225 Difference]: With dead ends: 499 [2021-08-27 07:50:25,266 INFO L226 Difference]: Without dead ends: 499 [2021-08-27 07:50:25,267 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:25,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2021-08-27 07:50:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2021-08-27 07:50:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 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:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 823 transitions. [2021-08-27 07:50:25,277 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 823 transitions. Word has length 24 [2021-08-27 07:50:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:25,277 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 823 transitions. [2021-08-27 07:50:25,278 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:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 823 transitions. [2021-08-27 07:50:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:50:25,279 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:25,279 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:25,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 07:50:25,280 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:25,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:25,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1427980054, now seen corresponding path program 1 times [2021-08-27 07:50:25,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:25,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226601970] [2021-08-27 07:50:25,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:25,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,347 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:25,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:25,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226601970] [2021-08-27 07:50:25,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226601970] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:25,350 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:25,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:25,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757780022] [2021-08-27 07:50:25,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:25,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:25,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:25,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:25,351 INFO L87 Difference]: Start difference. First operand 497 states and 823 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:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:25,468 INFO L93 Difference]: Finished difference Result 507 states and 824 transitions. [2021-08-27 07:50:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:25,469 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:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:25,471 INFO L225 Difference]: With dead ends: 507 [2021-08-27 07:50:25,471 INFO L226 Difference]: Without dead ends: 507 [2021-08-27 07:50:25,471 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-08-27 07:50:25,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2021-08-27 07:50:25,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 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:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 823 transitions. [2021-08-27 07:50:25,481 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 823 transitions. Word has length 25 [2021-08-27 07:50:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:25,481 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 823 transitions. [2021-08-27 07:50:25,481 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:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 823 transitions. [2021-08-27 07:50:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:50:25,482 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:25,483 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:25,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 07:50:25,483 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:25,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:25,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1855869992, now seen corresponding path program 1 times [2021-08-27 07:50:25,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:25,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661771095] [2021-08-27 07:50:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:25,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,533 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:25,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:25,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661771095] [2021-08-27 07:50:25,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661771095] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:25,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:25,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:25,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046888106] [2021-08-27 07:50:25,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:25,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:25,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:25,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:25,535 INFO L87 Difference]: Start difference. First operand 505 states and 823 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:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:25,658 INFO L93 Difference]: Finished difference Result 907 states and 1488 transitions. [2021-08-27 07:50:25,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:25,662 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:25,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:25,671 INFO L225 Difference]: With dead ends: 907 [2021-08-27 07:50:25,671 INFO L226 Difference]: Without dead ends: 907 [2021-08-27 07:50:25,672 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2021-08-27 07:50:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 713. [2021-08-27 07:50:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 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:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1135 transitions. [2021-08-27 07:50:25,689 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1135 transitions. Word has length 25 [2021-08-27 07:50:25,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:25,689 INFO L470 AbstractCegarLoop]: Abstraction has 713 states and 1135 transitions. [2021-08-27 07:50:25,689 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:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1135 transitions. [2021-08-27 07:50:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:50:25,690 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:25,690 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:25,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 07:50:25,691 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:25,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:25,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1269063978, now seen corresponding path program 1 times [2021-08-27 07:50:25,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:25,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819046914] [2021-08-27 07:50:25,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:25,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,752 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:25,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:25,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819046914] [2021-08-27 07:50:25,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819046914] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:25,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:25,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:25,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079605498] [2021-08-27 07:50:25,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:25,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:25,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:25,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:25,754 INFO L87 Difference]: Start difference. First operand 713 states and 1135 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:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:25,869 INFO L93 Difference]: Finished difference Result 971 states and 1528 transitions. [2021-08-27 07:50:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:25,869 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:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:25,873 INFO L225 Difference]: With dead ends: 971 [2021-08-27 07:50:25,873 INFO L226 Difference]: Without dead ends: 971 [2021-08-27 07:50:25,874 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2021-08-27 07:50:25,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969. [2021-08-27 07:50:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 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:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1527 transitions. [2021-08-27 07:50:25,900 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1527 transitions. Word has length 25 [2021-08-27 07:50:25,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:25,900 INFO L470 AbstractCegarLoop]: Abstraction has 969 states and 1527 transitions. [2021-08-27 07:50:25,900 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:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1527 transitions. [2021-08-27 07:50:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 07:50:25,902 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:25,902 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:25,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 07:50:25,902 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:25,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:25,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1697609651, now seen corresponding path program 1 times [2021-08-27 07:50:25,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:25,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800185259] [2021-08-27 07:50:25,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:25,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,953 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:25,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:25,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800185259] [2021-08-27 07:50:25,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800185259] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:25,954 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:25,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:25,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107083496] [2021-08-27 07:50:25,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:25,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:25,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:25,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:25,955 INFO L87 Difference]: Start difference. First operand 969 states and 1527 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:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:26,069 INFO L93 Difference]: Finished difference Result 987 states and 1528 transitions. [2021-08-27 07:50:26,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:26,069 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:26,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:26,073 INFO L225 Difference]: With dead ends: 987 [2021-08-27 07:50:26,073 INFO L226 Difference]: Without dead ends: 987 [2021-08-27 07:50:26,075 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:26,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2021-08-27 07:50:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 985. [2021-08-27 07:50:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 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:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1527 transitions. [2021-08-27 07:50:26,093 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1527 transitions. Word has length 26 [2021-08-27 07:50:26,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:26,094 INFO L470 AbstractCegarLoop]: Abstraction has 985 states and 1527 transitions. [2021-08-27 07:50:26,095 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:26,095 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1527 transitions. [2021-08-27 07:50:26,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 07:50:26,096 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:26,096 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:26,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 07:50:26,097 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:26,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:26,098 INFO L82 PathProgramCache]: Analyzing trace with hash 686492401, now seen corresponding path program 1 times [2021-08-27 07:50:26,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:26,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613475083] [2021-08-27 07:50:26,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:26,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,156 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:26,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:26,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613475083] [2021-08-27 07:50:26,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613475083] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:26,157 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:26,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:26,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960570415] [2021-08-27 07:50:26,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:26,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:26,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:26,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:26,159 INFO L87 Difference]: Start difference. First operand 985 states and 1527 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:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:26,272 INFO L93 Difference]: Finished difference Result 1739 states and 2712 transitions. [2021-08-27 07:50:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:26,273 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:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:26,279 INFO L225 Difference]: With dead ends: 1739 [2021-08-27 07:50:26,279 INFO L226 Difference]: Without dead ends: 1739 [2021-08-27 07:50:26,279 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:26,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2021-08-27 07:50:26,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1417. [2021-08-27 07:50:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 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:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2135 transitions. [2021-08-27 07:50:26,307 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2135 transitions. Word has length 26 [2021-08-27 07:50:26,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:26,307 INFO L470 AbstractCegarLoop]: Abstraction has 1417 states and 2135 transitions. [2021-08-27 07:50:26,308 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:26,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2135 transitions. [2021-08-27 07:50:26,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 07:50:26,309 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:26,310 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:26,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 07:50:26,310 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:26,311 INFO L82 PathProgramCache]: Analyzing trace with hash 99686387, now seen corresponding path program 1 times [2021-08-27 07:50:26,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:26,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228627961] [2021-08-27 07:50:26,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:26,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,362 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:26,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:26,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228627961] [2021-08-27 07:50:26,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228627961] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:26,362 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:26,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:26,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745854220] [2021-08-27 07:50:26,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:26,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:26,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:26,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:26,367 INFO L87 Difference]: Start difference. First operand 1417 states and 2135 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:26,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:26,486 INFO L93 Difference]: Finished difference Result 1899 states and 2824 transitions. [2021-08-27 07:50:26,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:26,487 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:26,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:26,493 INFO L225 Difference]: With dead ends: 1899 [2021-08-27 07:50:26,494 INFO L226 Difference]: Without dead ends: 1899 [2021-08-27 07:50:26,494 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:26,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2021-08-27 07:50:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1897. [2021-08-27 07:50:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 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:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2823 transitions. [2021-08-27 07:50:26,528 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2823 transitions. Word has length 26 [2021-08-27 07:50:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:26,528 INFO L470 AbstractCegarLoop]: Abstraction has 1897 states and 2823 transitions. [2021-08-27 07:50:26,529 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:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2823 transitions. [2021-08-27 07:50:26,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 07:50:26,531 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:26,531 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:26,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 07:50:26,531 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:26,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:26,532 INFO L82 PathProgramCache]: Analyzing trace with hash -193356961, now seen corresponding path program 1 times [2021-08-27 07:50:26,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:26,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609453867] [2021-08-27 07:50:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:26,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,572 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:26,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:26,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609453867] [2021-08-27 07:50:26,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609453867] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:26,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:26,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:26,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325394568] [2021-08-27 07:50:26,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:26,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:26,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:26,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:26,574 INFO L87 Difference]: Start difference. First operand 1897 states and 2823 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:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:26,691 INFO L93 Difference]: Finished difference Result 1931 states and 2824 transitions. [2021-08-27 07:50:26,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:26,692 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:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:26,698 INFO L225 Difference]: With dead ends: 1931 [2021-08-27 07:50:26,698 INFO L226 Difference]: Without dead ends: 1931 [2021-08-27 07:50:26,698 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:26,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2021-08-27 07:50:26,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1929. [2021-08-27 07:50:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 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:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2823 transitions. [2021-08-27 07:50:26,732 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2823 transitions. Word has length 27 [2021-08-27 07:50:26,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:26,732 INFO L470 AbstractCegarLoop]: Abstraction has 1929 states and 2823 transitions. [2021-08-27 07:50:26,732 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:26,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2823 transitions. [2021-08-27 07:50:26,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 07:50:26,734 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:26,734 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:26,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 07:50:26,735 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:26,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:26,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1204474211, now seen corresponding path program 1 times [2021-08-27 07:50:26,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:26,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093272341] [2021-08-27 07:50:26,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:26,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,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:26,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:26,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093272341] [2021-08-27 07:50:26,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093272341] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:26,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:26,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:26,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047099369] [2021-08-27 07:50:26,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:26,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:26,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:26,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:26,782 INFO L87 Difference]: Start difference. First operand 1929 states and 2823 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:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:26,892 INFO L93 Difference]: Finished difference Result 3339 states and 4904 transitions. [2021-08-27 07:50:26,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:26,893 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:26,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:26,904 INFO L225 Difference]: With dead ends: 3339 [2021-08-27 07:50:26,904 INFO L226 Difference]: Without dead ends: 3339 [2021-08-27 07:50:26,904 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:26,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2021-08-27 07:50:26,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2825. [2021-08-27 07:50:26,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 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:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 4007 transitions. [2021-08-27 07:50:26,965 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 4007 transitions. Word has length 27 [2021-08-27 07:50:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:26,966 INFO L470 AbstractCegarLoop]: Abstraction has 2825 states and 4007 transitions. [2021-08-27 07:50:26,966 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:26,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 4007 transitions. [2021-08-27 07:50:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 07:50:26,969 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:26,969 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:26,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 07:50:26,969 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:26,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:26,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1791280225, now seen corresponding path program 1 times [2021-08-27 07:50:26,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:26,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786527143] [2021-08-27 07:50:26,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:26,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,017 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:27,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:27,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786527143] [2021-08-27 07:50:27,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786527143] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:27,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:27,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:27,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584050513] [2021-08-27 07:50:27,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:27,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:27,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:27,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:27,019 INFO L87 Difference]: Start difference. First operand 2825 states and 4007 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:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:27,128 INFO L93 Difference]: Finished difference Result 3723 states and 5192 transitions. [2021-08-27 07:50:27,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:27,133 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:27,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:27,145 INFO L225 Difference]: With dead ends: 3723 [2021-08-27 07:50:27,146 INFO L226 Difference]: Without dead ends: 3723 [2021-08-27 07:50:27,146 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:27,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2021-08-27 07:50:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3721. [2021-08-27 07:50:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 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:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5191 transitions. [2021-08-27 07:50:27,224 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5191 transitions. Word has length 27 [2021-08-27 07:50:27,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:27,224 INFO L470 AbstractCegarLoop]: Abstraction has 3721 states and 5191 transitions. [2021-08-27 07:50:27,224 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:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5191 transitions. [2021-08-27 07:50:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:50:27,228 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:27,228 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:27,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 07:50:27,229 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:27,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:27,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1316220552, now seen corresponding path program 1 times [2021-08-27 07:50:27,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:27,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584209969] [2021-08-27 07:50:27,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:27,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:27,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:27,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584209969] [2021-08-27 07:50:27,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584209969] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:27,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:27,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:27,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741515681] [2021-08-27 07:50:27,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:27,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:27,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:27,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:27,281 INFO L87 Difference]: Start difference. First operand 3721 states and 5191 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:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:27,384 INFO L93 Difference]: Finished difference Result 3787 states and 5192 transitions. [2021-08-27 07:50:27,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:27,384 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:27,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:27,396 INFO L225 Difference]: With dead ends: 3787 [2021-08-27 07:50:27,396 INFO L226 Difference]: Without dead ends: 3787 [2021-08-27 07:50:27,396 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2021-08-27 07:50:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3785. [2021-08-27 07:50:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 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:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 5191 transitions. [2021-08-27 07:50:27,492 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 5191 transitions. Word has length 28 [2021-08-27 07:50:27,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:27,492 INFO L470 AbstractCegarLoop]: Abstraction has 3785 states and 5191 transitions. [2021-08-27 07:50:27,492 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:27,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 5191 transitions. [2021-08-27 07:50:27,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:50:27,496 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:27,496 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:27,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 07:50:27,496 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:27,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:27,497 INFO L82 PathProgramCache]: Analyzing trace with hash 305103302, now seen corresponding path program 1 times [2021-08-27 07:50:27,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:27,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808256802] [2021-08-27 07:50:27,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:27,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,537 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:27,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:27,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808256802] [2021-08-27 07:50:27,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808256802] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:27,538 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:27,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:27,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303349287] [2021-08-27 07:50:27,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:27,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:27,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:27,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:27,539 INFO L87 Difference]: Start difference. First operand 3785 states and 5191 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:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:27,658 INFO L93 Difference]: Finished difference Result 6411 states and 8776 transitions. [2021-08-27 07:50:27,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:27,659 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:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:27,690 INFO L225 Difference]: With dead ends: 6411 [2021-08-27 07:50:27,691 INFO L226 Difference]: Without dead ends: 6411 [2021-08-27 07:50:27,692 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:27,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2021-08-27 07:50:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 5641. [2021-08-27 07:50:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 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:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 7495 transitions. [2021-08-27 07:50:27,818 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 7495 transitions. Word has length 28 [2021-08-27 07:50:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:27,819 INFO L470 AbstractCegarLoop]: Abstraction has 5641 states and 7495 transitions. [2021-08-27 07:50:27,820 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:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 7495 transitions. [2021-08-27 07:50:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:50:27,828 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:27,828 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:27,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 07:50:27,829 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:27,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:27,829 INFO L82 PathProgramCache]: Analyzing trace with hash -281702712, now seen corresponding path program 1 times [2021-08-27 07:50:27,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:27,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205838390] [2021-08-27 07:50:27,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:27,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,870 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:27,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:27,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205838390] [2021-08-27 07:50:27,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205838390] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:27,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:27,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:27,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964998856] [2021-08-27 07:50:27,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:27,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:27,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:27,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:27,872 INFO L87 Difference]: Start difference. First operand 5641 states and 7495 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:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:28,010 INFO L93 Difference]: Finished difference Result 7307 states and 9480 transitions. [2021-08-27 07:50:28,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:28,011 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:28,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:28,022 INFO L225 Difference]: With dead ends: 7307 [2021-08-27 07:50:28,023 INFO L226 Difference]: Without dead ends: 7307 [2021-08-27 07:50:28,023 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:28,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2021-08-27 07:50:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 7305. [2021-08-27 07:50:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 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:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 9479 transitions. [2021-08-27 07:50:28,172 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 9479 transitions. Word has length 28 [2021-08-27 07:50:28,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:28,172 INFO L470 AbstractCegarLoop]: Abstraction has 7305 states and 9479 transitions. [2021-08-27 07:50:28,172 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:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 9479 transitions. [2021-08-27 07:50:28,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 07:50:28,179 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:28,179 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:28,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 07:50:28,179 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:28,180 INFO L82 PathProgramCache]: Analyzing trace with hash 868483540, now seen corresponding path program 1 times [2021-08-27 07:50:28,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:28,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017645611] [2021-08-27 07:50:28,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:28,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,222 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:28,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:28,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017645611] [2021-08-27 07:50:28,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017645611] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:28,223 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:28,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:28,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399961240] [2021-08-27 07:50:28,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:28,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:28,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:28,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:28,224 INFO L87 Difference]: Start difference. First operand 7305 states and 9479 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:28,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:28,340 INFO L93 Difference]: Finished difference Result 7435 states and 9480 transitions. [2021-08-27 07:50:28,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:28,341 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:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:28,353 INFO L225 Difference]: With dead ends: 7435 [2021-08-27 07:50:28,354 INFO L226 Difference]: Without dead ends: 7435 [2021-08-27 07:50:28,354 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2021-08-27 07:50:28,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7433. [2021-08-27 07:50:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 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:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7433 states to 7433 states and 9479 transitions. [2021-08-27 07:50:28,506 INFO L78 Accepts]: Start accepts. Automaton has 7433 states and 9479 transitions. Word has length 29 [2021-08-27 07:50:28,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:28,506 INFO L470 AbstractCegarLoop]: Abstraction has 7433 states and 9479 transitions. [2021-08-27 07:50:28,507 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:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 7433 states and 9479 transitions. [2021-08-27 07:50:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 07:50:28,515 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:28,515 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:28,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 07:50:28,515 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:28,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:28,516 INFO L82 PathProgramCache]: Analyzing trace with hash -142633710, now seen corresponding path program 1 times [2021-08-27 07:50:28,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:28,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665476940] [2021-08-27 07:50:28,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:28,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,559 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:28,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:28,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665476940] [2021-08-27 07:50:28,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665476940] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:28,559 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:28,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:28,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885409495] [2021-08-27 07:50:28,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:28,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:28,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:28,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:28,561 INFO L87 Difference]: Start difference. First operand 7433 states and 9479 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:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:28,701 INFO L93 Difference]: Finished difference Result 12299 states and 15496 transitions. [2021-08-27 07:50:28,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:28,702 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:28,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:28,724 INFO L225 Difference]: With dead ends: 12299 [2021-08-27 07:50:28,724 INFO L226 Difference]: Without dead ends: 12299 [2021-08-27 07:50:28,724 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12299 states. [2021-08-27 07:50:28,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12299 to 11273. [2021-08-27 07:50:28,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 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:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 13959 transitions. [2021-08-27 07:50:28,920 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 13959 transitions. Word has length 29 [2021-08-27 07:50:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:28,920 INFO L470 AbstractCegarLoop]: Abstraction has 11273 states and 13959 transitions. [2021-08-27 07:50:28,920 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:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 13959 transitions. [2021-08-27 07:50:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 07:50:28,934 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:28,934 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:28,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-27 07:50:28,935 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:28,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:28,936 INFO L82 PathProgramCache]: Analyzing trace with hash -729439724, now seen corresponding path program 1 times [2021-08-27 07:50:28,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:28,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833511739] [2021-08-27 07:50:28,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:28,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,980 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:28,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:28,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833511739] [2021-08-27 07:50:28,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833511739] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:28,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:28,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:28,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905030319] [2021-08-27 07:50:28,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:28,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:28,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:28,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:28,984 INFO L87 Difference]: Start difference. First operand 11273 states and 13959 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:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:29,161 INFO L93 Difference]: Finished difference Result 14347 states and 17160 transitions. [2021-08-27 07:50:29,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:29,165 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:29,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:29,186 INFO L225 Difference]: With dead ends: 14347 [2021-08-27 07:50:29,186 INFO L226 Difference]: Without dead ends: 14347 [2021-08-27 07:50:29,186 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:29,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2021-08-27 07:50:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 14345. [2021-08-27 07:50:29,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 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:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 17159 transitions. [2021-08-27 07:50:29,366 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 17159 transitions. Word has length 29 [2021-08-27 07:50:29,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:29,367 INFO L470 AbstractCegarLoop]: Abstraction has 14345 states and 17159 transitions. [2021-08-27 07:50:29,367 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:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 17159 transitions. [2021-08-27 07:50:29,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 07:50:29,381 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:29,381 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:29,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-27 07:50:29,381 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:29,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:29,382 INFO L82 PathProgramCache]: Analyzing trace with hash -126461603, now seen corresponding path program 1 times [2021-08-27 07:50:29,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:29,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783694464] [2021-08-27 07:50:29,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:29,383 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:29,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:29,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783694464] [2021-08-27 07:50:29,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783694464] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:29,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:29,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:29,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008518928] [2021-08-27 07:50:29,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:29,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:29,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:29,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:29,471 INFO L87 Difference]: Start difference. First operand 14345 states and 17159 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:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:29,604 INFO L93 Difference]: Finished difference Result 14603 states and 17160 transitions. [2021-08-27 07:50:29,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:29,604 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:29,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:29,629 INFO L225 Difference]: With dead ends: 14603 [2021-08-27 07:50:29,630 INFO L226 Difference]: Without dead ends: 14603 [2021-08-27 07:50:29,630 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:29,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2021-08-27 07:50:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 14601. [2021-08-27 07:50:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 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:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 17159 transitions. [2021-08-27 07:50:29,864 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 17159 transitions. Word has length 30 [2021-08-27 07:50:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:29,864 INFO L470 AbstractCegarLoop]: Abstraction has 14601 states and 17159 transitions. [2021-08-27 07:50:29,864 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:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 17159 transitions. [2021-08-27 07:50:29,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 07:50:29,880 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:29,880 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:29,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-27 07:50:29,881 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:29,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:29,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1137578853, now seen corresponding path program 1 times [2021-08-27 07:50:29,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:29,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644112246] [2021-08-27 07:50:29,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:29,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,928 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:29,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:29,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644112246] [2021-08-27 07:50:29,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644112246] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:29,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:29,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:29,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359506074] [2021-08-27 07:50:29,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:29,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:29,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:29,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:29,930 INFO L87 Difference]: Start difference. First operand 14601 states and 17159 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:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:30,116 INFO L93 Difference]: Finished difference Result 28169 states and 31239 transitions. [2021-08-27 07:50:30,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:30,116 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:30,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:30,150 INFO L225 Difference]: With dead ends: 28169 [2021-08-27 07:50:30,150 INFO L226 Difference]: Without dead ends: 14601 [2021-08-27 07:50:30,151 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:30,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14601 states. [2021-08-27 07:50:30,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14601 to 14601. [2021-08-27 07:50:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 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:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 16135 transitions. [2021-08-27 07:50:30,493 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 16135 transitions. Word has length 30 [2021-08-27 07:50:30,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:30,494 INFO L470 AbstractCegarLoop]: Abstraction has 14601 states and 16135 transitions. [2021-08-27 07:50:30,494 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:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2021-08-27 07:50:30,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 07:50:30,513 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:30,513 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:30,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-27 07:50:30,514 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:30,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:30,514 INFO L82 PathProgramCache]: Analyzing trace with hash -550772839, now seen corresponding path program 1 times [2021-08-27 07:50:30,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:30,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319930661] [2021-08-27 07:50:30,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:30,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,555 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:30,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:30,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319930661] [2021-08-27 07:50:30,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319930661] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:30,557 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:30,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:30,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716182330] [2021-08-27 07:50:30,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:30,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:30,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:30,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:30,558 INFO L87 Difference]: Start difference. First operand 14601 states and 16135 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:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:30,640 INFO L93 Difference]: Finished difference Result 14599 states and 15622 transitions. [2021-08-27 07:50:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:30,641 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:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:30,641 INFO L225 Difference]: With dead ends: 14599 [2021-08-27 07:50:30,641 INFO L226 Difference]: Without dead ends: 0 [2021-08-27 07:50:30,641 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:30,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-27 07:50:30,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-27 07:50:30,642 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:50:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 07:50:30,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2021-08-27 07:50:30,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:30,642 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 07:50:30,642 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:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-27 07:50:30,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-27 07:50:30,644 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 07:50:30,649 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 07:50:30,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 07:50:30,653 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 07:50:30,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 07:50:30 BoogieIcfgContainer [2021-08-27 07:50:30,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 07:50:30,656 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 07:50:30,656 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 07:50:30,656 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 07:50:30,656 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:22" (3/4) ... [2021-08-27 07:50:30,659 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-27 07:50:30,664 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-08-27 07:50:30,664 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-08-27 07:50:30,664 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-08-27 07:50:30,669 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-08-27 07:50:30,669 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-27 07:50:30,669 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-27 07:50:30,670 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-27 07:50:30,707 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 07:50:30,708 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 07:50:30,709 INFO L168 Benchmark]: Toolchain (without parser) took 9521.38 ms. Allocated memory was 56.6 MB in the beginning and 627.0 MB in the end (delta: 570.4 MB). Free memory was 35.5 MB in the beginning and 421.8 MB in the end (delta: -386.4 MB). Peak memory consumption was 183.4 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:30,710 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 56.6 MB. Free memory was 38.7 MB in the beginning and 38.6 MB in the end (delta: 39.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:50:30,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.94 ms. Allocated memory is still 56.6 MB. Free memory was 35.3 MB in the beginning and 39.0 MB in the end (delta: -3.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:30,710 INFO L168 Benchmark]: Boogie Preprocessor took 58.89 ms. Allocated memory is still 56.6 MB. Free memory was 39.0 MB in the beginning and 37.2 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:50:30,710 INFO L168 Benchmark]: RCFGBuilder took 537.22 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 37.2 MB in the beginning and 41.8 MB in the end (delta: -4.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:30,711 INFO L168 Benchmark]: TraceAbstraction took 8538.35 ms. Allocated memory was 69.2 MB in the beginning and 627.0 MB in the end (delta: 557.8 MB). Free memory was 41.5 MB in the beginning and 426.0 MB in the end (delta: -384.5 MB). Peak memory consumption was 172.6 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:30,711 INFO L168 Benchmark]: Witness Printer took 52.19 ms. Allocated memory is still 627.0 MB. Free memory was 426.0 MB in the beginning and 421.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:30,712 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.18 ms. Allocated memory is still 56.6 MB. Free memory was 38.7 MB in the beginning and 38.6 MB in the end (delta: 39.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 328.94 ms. Allocated memory is still 56.6 MB. Free memory was 35.3 MB in the beginning and 39.0 MB in the end (delta: -3.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 58.89 ms. Allocated memory is still 56.6 MB. Free memory was 39.0 MB in the beginning and 37.2 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 537.22 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 37.2 MB in the beginning and 41.8 MB in the end (delta: -4.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8538.35 ms. Allocated memory was 69.2 MB in the beginning and 627.0 MB in the end (delta: 557.8 MB). Free memory was 41.5 MB in the beginning and 426.0 MB in the end (delta: -384.5 MB). Peak memory consumption was 172.6 MB. Max. memory is 16.1 GB. * Witness Printer took 52.19 ms. Allocated memory is still 627.0 MB. Free memory was 426.0 MB in the beginning and 421.8 MB 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: 163]: 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, 49 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 8490.4ms, OverallIterations: 29, TraceHistogramMax: 1, EmptinessCheckTime: 129.5ms, AutomataDifference: 4337.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2422 SDtfs, 3612 SDslu, 171 SDs, 0 SdLazy, 1705 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2095.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1409.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14601occurred in iteration=27, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1883.5ms AutomataMinimizationTime, 29 MinimizatonAttempts, 3100 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 44.8ms SsaConstructionTime, 216.0ms SatisfiabilityAnalysisTime, 1565.9ms InterpolantComputationTime, 730 NumberOfCodeBlocks, 730 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 701 ConstructedInterpolants, 0 QuantifiedInterpolants, 2231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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:50:30,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...