./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_9.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_9.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 20a70402cc893fb2c7adec21ca8a267adc3c5cbb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 07:51:23,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 07:51:23,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 07:51:23,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 07:51:23,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 07:51:23,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 07:51:23,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 07:51:23,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 07:51:23,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 07:51:23,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 07:51:23,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 07:51:23,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 07:51:23,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 07:51:23,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 07:51:23,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 07:51:23,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 07:51:23,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 07:51:23,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 07:51:23,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 07:51:23,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 07:51:23,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 07:51:23,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 07:51:23,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 07:51:23,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 07:51:23,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 07:51:23,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 07:51:23,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 07:51:23,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 07:51:23,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 07:51:23,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 07:51:23,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 07:51:23,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 07:51:23,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 07:51:23,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 07:51:23,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 07:51:23,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 07:51:23,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 07:51:23,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 07:51:23,991 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 07:51:23,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 07:51:23,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 07:51:23,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 07:51:24,040 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 07:51:24,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 07:51:24,041 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 07:51:24,041 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 07:51:24,043 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 07:51:24,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 07:51:24,044 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 07:51:24,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 07:51:24,044 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 07:51:24,044 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 07:51:24,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 07:51:24,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 07:51:24,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 07:51:24,046 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 07:51:24,046 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 07:51:24,047 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 07:51:24,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 07:51:24,047 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 07:51:24,047 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 07:51:24,047 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 07:51:24,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 07:51:24,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 07:51:24,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 07:51:24,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:51:24,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 07:51:24,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 07:51:24,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 07:51:24,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 07:51:24,049 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 07:51:24,050 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 -> 20a70402cc893fb2c7adec21ca8a267adc3c5cbb [2021-08-27 07:51:24,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 07:51:24,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 07:51:24,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 07:51:24,400 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 07:51:24,401 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 07:51:24,402 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2021-08-27 07:51:24,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d0944352/034249ac53f44b93a12cdfc89664df44/FLAG6611b55b5 [2021-08-27 07:51:24,930 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 07:51:24,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2021-08-27 07:51:24,941 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d0944352/034249ac53f44b93a12cdfc89664df44/FLAG6611b55b5 [2021-08-27 07:51:25,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d0944352/034249ac53f44b93a12cdfc89664df44 [2021-08-27 07:51:25,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 07:51:25,375 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 07:51:25,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 07:51:25,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 07:51:25,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 07:51:25,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:51:25" (1/1) ... [2021-08-27 07:51:25,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ced501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:25, skipping insertion in model container [2021-08-27 07:51:25,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:51:25" (1/1) ... [2021-08-27 07:51:25,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 07:51:25,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 07:51:25,576 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_9.c[3555,3568] [2021-08-27 07:51:25,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:51:25,596 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 07:51:25,642 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_9.c[3555,3568] [2021-08-27 07:51:25,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:51:25,657 INFO L208 MainTranslator]: Completed translation [2021-08-27 07:51:25,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:25 WrapperNode [2021-08-27 07:51:25,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 07:51:25,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 07:51:25,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 07:51:25,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 07:51:25,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:25" (1/1) ... [2021-08-27 07:51:25,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:25" (1/1) ... [2021-08-27 07:51:25,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:25" (1/1) ... [2021-08-27 07:51:25,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:25" (1/1) ... [2021-08-27 07:51:25,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:25" (1/1) ... [2021-08-27 07:51:25,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:25" (1/1) ... [2021-08-27 07:51:25,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:25" (1/1) ... [2021-08-27 07:51:25,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 07:51:25,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 07:51:25,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 07:51:25,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 07:51:25,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:25" (1/1) ... [2021-08-27 07:51:25,723 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:51:25,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:51:25,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 07:51:25,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 07:51:25,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 07:51:25,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 07:51:25,793 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 07:51:25,794 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 07:51:25,794 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 07:51:25,794 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 07:51:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 07:51:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 07:51:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 07:51:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 07:51:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 07:51:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 07:51:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 07:51:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 07:51:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 07:51:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 07:51:26,232 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 07:51:26,233 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-08-27 07:51:26,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:51:26 BoogieIcfgContainer [2021-08-27 07:51:26,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 07:51:26,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 07:51:26,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 07:51:26,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 07:51:26,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 07:51:25" (1/3) ... [2021-08-27 07:51:26,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdb5a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:51:26, skipping insertion in model container [2021-08-27 07:51:26,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:51:25" (2/3) ... [2021-08-27 07:51:26,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdb5a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:51:26, skipping insertion in model container [2021-08-27 07:51:26,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:51:26" (3/3) ... [2021-08-27 07:51:26,242 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2021-08-27 07:51:26,247 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 07:51:26,247 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-27 07:51:26,282 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 07:51:26,286 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 07:51:26,287 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-27 07:51:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 38 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 07:51:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 07:51:26,304 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:26,304 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:26,305 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr1ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:26,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:26,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1545970075, now seen corresponding path program 1 times [2021-08-27 07:51:26,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:26,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838040855] [2021-08-27 07:51:26,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:26,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:26,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:26,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838040855] [2021-08-27 07:51:26,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838040855] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:26,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:26,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 07:51:26,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816594175] [2021-08-27 07:51:26,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 07:51:26,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:26,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 07:51:26,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:51:26,621 INFO L87 Difference]: Start difference. First operand has 43 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 38 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:26,659 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2021-08-27 07:51:26,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:51:26,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 07:51:26,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:26,668 INFO L225 Difference]: With dead ends: 42 [2021-08-27 07:51:26,669 INFO L226 Difference]: Without dead ends: 37 [2021-08-27 07:51:26,670 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:51:26,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-08-27 07:51:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-08-27 07:51:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2021-08-27 07:51:26,703 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 9 [2021-08-27 07:51:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:26,703 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2021-08-27 07:51:26,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2021-08-27 07:51:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 07:51:26,706 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:26,706 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:26,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 07:51:26,707 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1171509738, now seen corresponding path program 1 times [2021-08-27 07:51:26,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:26,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702066387] [2021-08-27 07:51:26,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:26,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:26,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:26,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702066387] [2021-08-27 07:51:26,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702066387] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:26,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:26,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:26,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118821005] [2021-08-27 07:51:26,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:26,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:26,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:26,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:26,862 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:27,061 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2021-08-27 07:51:27,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:27,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 07:51:27,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:27,063 INFO L225 Difference]: With dead ends: 67 [2021-08-27 07:51:27,063 INFO L226 Difference]: Without dead ends: 67 [2021-08-27 07:51:27,064 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 85.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-08-27 07:51:27,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2021-08-27 07:51:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 82 transitions. [2021-08-27 07:51:27,073 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 82 transitions. Word has length 20 [2021-08-27 07:51:27,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:27,074 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 82 transitions. [2021-08-27 07:51:27,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,074 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2021-08-27 07:51:27,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 07:51:27,075 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:27,075 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:27,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 07:51:27,077 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:27,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:27,078 INFO L82 PathProgramCache]: Analyzing trace with hash -913344300, now seen corresponding path program 1 times [2021-08-27 07:51:27,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:27,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698959126] [2021-08-27 07:51:27,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:27,080 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:27,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:27,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:27,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:27,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698959126] [2021-08-27 07:51:27,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698959126] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:27,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:27,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:27,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040977142] [2021-08-27 07:51:27,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:27,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:27,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:27,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:27,205 INFO L87 Difference]: Start difference. First operand 47 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:27,371 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2021-08-27 07:51:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:27,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 07:51:27,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:27,378 INFO L225 Difference]: With dead ends: 67 [2021-08-27 07:51:27,378 INFO L226 Difference]: Without dead ends: 67 [2021-08-27 07:51:27,378 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:27,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-08-27 07:51:27,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2021-08-27 07:51:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 114 transitions. [2021-08-27 07:51:27,398 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 114 transitions. Word has length 20 [2021-08-27 07:51:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:27,398 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 114 transitions. [2021-08-27 07:51:27,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,399 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 114 transitions. [2021-08-27 07:51:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 07:51:27,400 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:27,400 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:27,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 07:51:27,400 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:27,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:27,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1956849803, now seen corresponding path program 1 times [2021-08-27 07:51:27,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:27,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487026629] [2021-08-27 07:51:27,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:27,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:27,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:27,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:27,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487026629] [2021-08-27 07:51:27,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487026629] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:27,491 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:27,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:27,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438214833] [2021-08-27 07:51:27,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:27,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:27,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:27,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:27,494 INFO L87 Difference]: Start difference. First operand 65 states and 114 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:27,621 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2021-08-27 07:51:27,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:27,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 07:51:27,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:27,623 INFO L225 Difference]: With dead ends: 70 [2021-08-27 07:51:27,623 INFO L226 Difference]: Without dead ends: 70 [2021-08-27 07:51:27,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-27 07:51:27,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2021-08-27 07:51:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2021-08-27 07:51:27,638 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 21 [2021-08-27 07:51:27,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:27,639 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2021-08-27 07:51:27,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2021-08-27 07:51:27,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 07:51:27,640 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:27,640 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:27,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 07:51:27,641 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:27,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:27,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1751311479, now seen corresponding path program 1 times [2021-08-27 07:51:27,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:27,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959846112] [2021-08-27 07:51:27,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:27,643 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:27,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:27,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:27,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959846112] [2021-08-27 07:51:27,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959846112] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:27,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:27,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:27,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864626653] [2021-08-27 07:51:27,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:27,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:27,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:27,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:27,727 INFO L87 Difference]: Start difference. First operand 68 states and 116 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:27,857 INFO L93 Difference]: Finished difference Result 125 states and 214 transitions. [2021-08-27 07:51:27,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:27,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 07:51:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:27,860 INFO L225 Difference]: With dead ends: 125 [2021-08-27 07:51:27,860 INFO L226 Difference]: Without dead ends: 125 [2021-08-27 07:51:27,861 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-08-27 07:51:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2021-08-27 07:51:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 213 transitions. [2021-08-27 07:51:27,878 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 213 transitions. Word has length 21 [2021-08-27 07:51:27,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:27,879 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 213 transitions. [2021-08-27 07:51:27,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 213 transitions. [2021-08-27 07:51:27,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 07:51:27,880 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:27,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] [2021-08-27 07:51:27,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 07:51:27,881 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:27,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:27,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1493146041, now seen corresponding path program 1 times [2021-08-27 07:51:27,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:27,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073942902] [2021-08-27 07:51:27,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:27,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:27,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:27,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:27,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073942902] [2021-08-27 07:51:27,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073942902] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:27,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:27,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:27,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782902139] [2021-08-27 07:51:27,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:27,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:27,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:27,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:27,959 INFO L87 Difference]: Start difference. First operand 123 states and 213 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:28,078 INFO L93 Difference]: Finished difference Result 157 states and 272 transitions. [2021-08-27 07:51:28,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:28,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 07:51:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:28,080 INFO L225 Difference]: With dead ends: 157 [2021-08-27 07:51:28,080 INFO L226 Difference]: Without dead ends: 157 [2021-08-27 07:51:28,081 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:51:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-27 07:51:28,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 123. [2021-08-27 07:51:28,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 211 transitions. [2021-08-27 07:51:28,095 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 211 transitions. Word has length 21 [2021-08-27 07:51:28,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:28,095 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 211 transitions. [2021-08-27 07:51:28,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 211 transitions. [2021-08-27 07:51:28,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 07:51:28,101 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:28,102 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:28,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 07:51:28,102 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:28,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:28,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1543704951, now seen corresponding path program 1 times [2021-08-27 07:51:28,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:28,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737751977] [2021-08-27 07:51:28,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:28,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:28,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:28,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:28,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737751977] [2021-08-27 07:51:28,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737751977] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:28,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:28,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:28,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113513570] [2021-08-27 07:51:28,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:28,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:28,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:28,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:28,180 INFO L87 Difference]: Start difference. First operand 123 states and 211 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:28,310 INFO L93 Difference]: Finished difference Result 225 states and 390 transitions. [2021-08-27 07:51:28,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:28,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 07:51:28,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:28,313 INFO L225 Difference]: With dead ends: 225 [2021-08-27 07:51:28,313 INFO L226 Difference]: Without dead ends: 225 [2021-08-27 07:51:28,313 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-08-27 07:51:28,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 167. [2021-08-27 07:51:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 285 transitions. [2021-08-27 07:51:28,319 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 285 transitions. Word has length 22 [2021-08-27 07:51:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:28,320 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 285 transitions. [2021-08-27 07:51:28,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 285 transitions. [2021-08-27 07:51:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 07:51:28,323 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:28,323 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:28,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 07:51:28,324 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:28,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:28,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1285539513, now seen corresponding path program 1 times [2021-08-27 07:51:28,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:28,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775983207] [2021-08-27 07:51:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:28,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:28,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:28,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:28,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775983207] [2021-08-27 07:51:28,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775983207] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:28,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:28,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:28,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717119407] [2021-08-27 07:51:28,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:28,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:28,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:28,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:28,375 INFO L87 Difference]: Start difference. First operand 167 states and 285 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:28,514 INFO L93 Difference]: Finished difference Result 233 states and 392 transitions. [2021-08-27 07:51:28,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:28,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 07:51:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:28,516 INFO L225 Difference]: With dead ends: 233 [2021-08-27 07:51:28,516 INFO L226 Difference]: Without dead ends: 233 [2021-08-27 07:51:28,516 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-08-27 07:51:28,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2021-08-27 07:51:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 391 transitions. [2021-08-27 07:51:28,521 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 391 transitions. Word has length 22 [2021-08-27 07:51:28,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:28,521 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 391 transitions. [2021-08-27 07:51:28,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 391 transitions. [2021-08-27 07:51:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 07:51:28,522 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:28,522 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:28,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 07:51:28,523 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:28,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:28,523 INFO L82 PathProgramCache]: Analyzing trace with hash -609998836, now seen corresponding path program 1 times [2021-08-27 07:51:28,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:28,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314291774] [2021-08-27 07:51:28,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:28,524 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:28,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:28,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:28,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314291774] [2021-08-27 07:51:28,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314291774] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:28,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:28,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:28,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918640534] [2021-08-27 07:51:28,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:28,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:28,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:28,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:28,585 INFO L87 Difference]: Start difference. First operand 231 states and 391 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:28,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:28,701 INFO L93 Difference]: Finished difference Result 239 states and 396 transitions. [2021-08-27 07:51:28,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:28,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 07:51:28,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:28,703 INFO L225 Difference]: With dead ends: 239 [2021-08-27 07:51:28,703 INFO L226 Difference]: Without dead ends: 239 [2021-08-27 07:51:28,703 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:28,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-08-27 07:51:28,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2021-08-27 07:51:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 395 transitions. [2021-08-27 07:51:28,709 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 395 transitions. Word has length 23 [2021-08-27 07:51:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:28,709 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 395 transitions. [2021-08-27 07:51:28,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 395 transitions. [2021-08-27 07:51:28,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 07:51:28,710 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:28,710 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:28,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 07:51:28,711 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:28,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:28,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1196804850, now seen corresponding path program 1 times [2021-08-27 07:51:28,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:28,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807237705] [2021-08-27 07:51:28,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:28,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:28,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:28,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:28,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807237705] [2021-08-27 07:51:28,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807237705] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:28,768 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:28,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:28,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249695770] [2021-08-27 07:51:28,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:28,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:28,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:28,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:28,770 INFO L87 Difference]: Start difference. First operand 237 states and 395 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:28,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:28,899 INFO L93 Difference]: Finished difference Result 427 states and 716 transitions. [2021-08-27 07:51:28,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:28,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 07:51:28,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:28,902 INFO L225 Difference]: With dead ends: 427 [2021-08-27 07:51:28,902 INFO L226 Difference]: Without dead ends: 427 [2021-08-27 07:51:28,902 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-08-27 07:51:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 329. [2021-08-27 07:51:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:28,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 539 transitions. [2021-08-27 07:51:28,910 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 539 transitions. Word has length 23 [2021-08-27 07:51:28,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:28,911 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 539 transitions. [2021-08-27 07:51:28,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:28,911 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 539 transitions. [2021-08-27 07:51:28,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 07:51:28,912 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:28,912 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:28,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 07:51:28,912 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:28,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:28,913 INFO L82 PathProgramCache]: Analyzing trace with hash -938639412, now seen corresponding path program 1 times [2021-08-27 07:51:28,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:28,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887119144] [2021-08-27 07:51:28,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:28,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:28,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:28,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:28,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887119144] [2021-08-27 07:51:28,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887119144] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:28,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:28,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:28,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101041270] [2021-08-27 07:51:28,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:28,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:28,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:28,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:28,969 INFO L87 Difference]: Start difference. First operand 329 states and 539 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:29,093 INFO L93 Difference]: Finished difference Result 451 states and 728 transitions. [2021-08-27 07:51:29,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:29,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 07:51:29,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:29,097 INFO L225 Difference]: With dead ends: 451 [2021-08-27 07:51:29,097 INFO L226 Difference]: Without dead ends: 451 [2021-08-27 07:51:29,098 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:29,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-08-27 07:51:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2021-08-27 07:51:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 727 transitions. [2021-08-27 07:51:29,110 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 727 transitions. Word has length 23 [2021-08-27 07:51:29,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:29,112 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 727 transitions. [2021-08-27 07:51:29,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 727 transitions. [2021-08-27 07:51:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 07:51:29,113 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:29,113 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:29,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 07:51:29,116 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:29,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:29,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1553970044, now seen corresponding path program 1 times [2021-08-27 07:51:29,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:29,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557286182] [2021-08-27 07:51:29,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:29,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:29,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:29,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:29,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557286182] [2021-08-27 07:51:29,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557286182] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:29,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:29,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:29,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800790312] [2021-08-27 07:51:29,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:29,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:29,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:29,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:29,180 INFO L87 Difference]: Start difference. First operand 449 states and 727 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:29,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:29,295 INFO L93 Difference]: Finished difference Result 459 states and 728 transitions. [2021-08-27 07:51:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:29,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 07:51:29,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:29,297 INFO L225 Difference]: With dead ends: 459 [2021-08-27 07:51:29,297 INFO L226 Difference]: Without dead ends: 459 [2021-08-27 07:51:29,298 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:29,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-08-27 07:51:29,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2021-08-27 07:51:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:29,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 727 transitions. [2021-08-27 07:51:29,308 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 727 transitions. Word has length 24 [2021-08-27 07:51:29,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:29,308 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 727 transitions. [2021-08-27 07:51:29,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 727 transitions. [2021-08-27 07:51:29,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 07:51:29,309 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:29,309 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:29,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 07:51:29,310 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:29,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:29,310 INFO L82 PathProgramCache]: Analyzing trace with hash 967164030, now seen corresponding path program 1 times [2021-08-27 07:51:29,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:29,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057084198] [2021-08-27 07:51:29,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:29,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:29,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:29,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:29,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057084198] [2021-08-27 07:51:29,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057084198] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:29,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:29,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:29,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904272955] [2021-08-27 07:51:29,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:29,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:29,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:29,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:29,353 INFO L87 Difference]: Start difference. First operand 457 states and 727 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:29,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:29,450 INFO L93 Difference]: Finished difference Result 811 states and 1296 transitions. [2021-08-27 07:51:29,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:29,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 07:51:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:29,454 INFO L225 Difference]: With dead ends: 811 [2021-08-27 07:51:29,454 INFO L226 Difference]: Without dead ends: 811 [2021-08-27 07:51:29,455 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:29,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2021-08-27 07:51:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 649. [2021-08-27 07:51:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1007 transitions. [2021-08-27 07:51:29,474 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1007 transitions. Word has length 24 [2021-08-27 07:51:29,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:29,475 INFO L470 AbstractCegarLoop]: Abstraction has 649 states and 1007 transitions. [2021-08-27 07:51:29,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:29,475 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1007 transitions. [2021-08-27 07:51:29,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 07:51:29,476 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:29,477 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:29,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 07:51:29,477 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:29,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:29,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1225329468, now seen corresponding path program 1 times [2021-08-27 07:51:29,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:29,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418085212] [2021-08-27 07:51:29,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:29,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:29,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:29,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:29,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418085212] [2021-08-27 07:51:29,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418085212] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:29,529 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:29,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:29,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793257361] [2021-08-27 07:51:29,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:29,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:29,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:29,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:29,530 INFO L87 Difference]: Start difference. First operand 649 states and 1007 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:29,632 INFO L93 Difference]: Finished difference Result 875 states and 1336 transitions. [2021-08-27 07:51:29,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:29,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 07:51:29,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:29,636 INFO L225 Difference]: With dead ends: 875 [2021-08-27 07:51:29,636 INFO L226 Difference]: Without dead ends: 875 [2021-08-27 07:51:29,637 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2021-08-27 07:51:29,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2021-08-27 07:51:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1335 transitions. [2021-08-27 07:51:29,655 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1335 transitions. Word has length 24 [2021-08-27 07:51:29,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:29,655 INFO L470 AbstractCegarLoop]: Abstraction has 873 states and 1335 transitions. [2021-08-27 07:51:29,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1335 transitions. [2021-08-27 07:51:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:51:29,657 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:29,657 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:29,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 07:51:29,657 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:29,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:29,658 INFO L82 PathProgramCache]: Analyzing trace with hash -82471071, now seen corresponding path program 1 times [2021-08-27 07:51:29,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:29,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103556024] [2021-08-27 07:51:29,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:29,659 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:29,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:29,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:29,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103556024] [2021-08-27 07:51:29,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103556024] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:29,718 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:29,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:29,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259104103] [2021-08-27 07:51:29,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:29,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:29,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:29,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:29,720 INFO L87 Difference]: Start difference. First operand 873 states and 1335 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:29,828 INFO L93 Difference]: Finished difference Result 891 states and 1336 transitions. [2021-08-27 07:51:29,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:29,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 07:51:29,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:29,832 INFO L225 Difference]: With dead ends: 891 [2021-08-27 07:51:29,833 INFO L226 Difference]: Without dead ends: 891 [2021-08-27 07:51:29,833 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:29,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2021-08-27 07:51:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 889. [2021-08-27 07:51:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1335 transitions. [2021-08-27 07:51:29,851 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1335 transitions. Word has length 25 [2021-08-27 07:51:29,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:29,851 INFO L470 AbstractCegarLoop]: Abstraction has 889 states and 1335 transitions. [2021-08-27 07:51:29,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1335 transitions. [2021-08-27 07:51:29,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:51:29,853 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:29,853 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:29,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 07:51:29,853 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:29,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:29,854 INFO L82 PathProgramCache]: Analyzing trace with hash -669277085, now seen corresponding path program 1 times [2021-08-27 07:51:29,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:29,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011827340] [2021-08-27 07:51:29,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:29,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:29,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:29,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:29,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011827340] [2021-08-27 07:51:29,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011827340] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:29,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:29,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:29,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482344874] [2021-08-27 07:51:29,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:29,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:29,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:29,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:29,912 INFO L87 Difference]: Start difference. First operand 889 states and 1335 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:30,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:30,018 INFO L93 Difference]: Finished difference Result 1547 states and 2328 transitions. [2021-08-27 07:51:30,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:30,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 07:51:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:30,023 INFO L225 Difference]: With dead ends: 1547 [2021-08-27 07:51:30,023 INFO L226 Difference]: Without dead ends: 1547 [2021-08-27 07:51:30,023 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:30,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2021-08-27 07:51:30,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1289. [2021-08-27 07:51:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1879 transitions. [2021-08-27 07:51:30,048 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1879 transitions. Word has length 25 [2021-08-27 07:51:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:30,048 INFO L470 AbstractCegarLoop]: Abstraction has 1289 states and 1879 transitions. [2021-08-27 07:51:30,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1879 transitions. [2021-08-27 07:51:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:51:30,050 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:30,050 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:30,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 07:51:30,051 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:30,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:30,051 INFO L82 PathProgramCache]: Analyzing trace with hash -411111647, now seen corresponding path program 1 times [2021-08-27 07:51:30,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:30,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176309139] [2021-08-27 07:51:30,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:30,052 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:30,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:30,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:30,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176309139] [2021-08-27 07:51:30,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176309139] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:30,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:30,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:30,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206328258] [2021-08-27 07:51:30,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:30,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:30,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:30,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:30,096 INFO L87 Difference]: Start difference. First operand 1289 states and 1879 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:30,203 INFO L93 Difference]: Finished difference Result 1707 states and 2440 transitions. [2021-08-27 07:51:30,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:30,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 07:51:30,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:30,209 INFO L225 Difference]: With dead ends: 1707 [2021-08-27 07:51:30,209 INFO L226 Difference]: Without dead ends: 1707 [2021-08-27 07:51:30,210 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:30,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2021-08-27 07:51:30,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1705. [2021-08-27 07:51:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2439 transitions. [2021-08-27 07:51:30,264 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2439 transitions. Word has length 25 [2021-08-27 07:51:30,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:30,264 INFO L470 AbstractCegarLoop]: Abstraction has 1705 states and 2439 transitions. [2021-08-27 07:51:30,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:30,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2439 transitions. [2021-08-27 07:51:30,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 07:51:30,267 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:30,267 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:30,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 07:51:30,268 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:30,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:30,268 INFO L82 PathProgramCache]: Analyzing trace with hash 727462257, now seen corresponding path program 1 times [2021-08-27 07:51:30,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:30,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812946874] [2021-08-27 07:51:30,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:30,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:30,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:30,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:30,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812946874] [2021-08-27 07:51:30,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812946874] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:30,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:30,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:30,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907382680] [2021-08-27 07:51:30,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:30,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:30,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:30,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:30,315 INFO L87 Difference]: Start difference. First operand 1705 states and 2439 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:30,419 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2021-08-27 07:51:30,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:30,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 07:51:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:30,425 INFO L225 Difference]: With dead ends: 1739 [2021-08-27 07:51:30,425 INFO L226 Difference]: Without dead ends: 1739 [2021-08-27 07:51:30,426 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2021-08-27 07:51:30,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1737. [2021-08-27 07:51:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2439 transitions. [2021-08-27 07:51:30,461 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2439 transitions. Word has length 26 [2021-08-27 07:51:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:30,461 INFO L470 AbstractCegarLoop]: Abstraction has 1737 states and 2439 transitions. [2021-08-27 07:51:30,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2439 transitions. [2021-08-27 07:51:30,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 07:51:30,464 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:30,464 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:30,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 07:51:30,465 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:30,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:30,465 INFO L82 PathProgramCache]: Analyzing trace with hash 140656243, now seen corresponding path program 1 times [2021-08-27 07:51:30,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:30,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267418420] [2021-08-27 07:51:30,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:30,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:30,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:30,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:30,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:30,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267418420] [2021-08-27 07:51:30,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267418420] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:30,520 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:30,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:30,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474126028] [2021-08-27 07:51:30,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:30,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:30,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:30,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:30,521 INFO L87 Difference]: Start difference. First operand 1737 states and 2439 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:30,641 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2021-08-27 07:51:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:30,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 07:51:30,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:30,651 INFO L225 Difference]: With dead ends: 2955 [2021-08-27 07:51:30,652 INFO L226 Difference]: Without dead ends: 2955 [2021-08-27 07:51:30,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:30,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2021-08-27 07:51:30,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2569. [2021-08-27 07:51:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3495 transitions. [2021-08-27 07:51:30,705 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3495 transitions. Word has length 26 [2021-08-27 07:51:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:30,705 INFO L470 AbstractCegarLoop]: Abstraction has 2569 states and 3495 transitions. [2021-08-27 07:51:30,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:30,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3495 transitions. [2021-08-27 07:51:30,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 07:51:30,709 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:30,709 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:51:30,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 07:51:30,709 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:30,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:30,710 INFO L82 PathProgramCache]: Analyzing trace with hash 398821681, now seen corresponding path program 1 times [2021-08-27 07:51:30,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:30,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96634110] [2021-08-27 07:51:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:30,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:30,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:30,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:51:30,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:30,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96634110] [2021-08-27 07:51:30,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96634110] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:30,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:30,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:30,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224204092] [2021-08-27 07:51:30,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:30,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:30,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:30,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:30,756 INFO L87 Difference]: Start difference. First operand 2569 states and 3495 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:30,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:30,858 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2021-08-27 07:51:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:30,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 07:51:30,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:30,870 INFO L225 Difference]: With dead ends: 3339 [2021-08-27 07:51:30,870 INFO L226 Difference]: Without dead ends: 3339 [2021-08-27 07:51:30,871 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2021-08-27 07:51:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3337. [2021-08-27 07:51:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 4423 transitions. [2021-08-27 07:51:30,947 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 4423 transitions. Word has length 26 [2021-08-27 07:51:30,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:30,947 INFO L470 AbstractCegarLoop]: Abstraction has 3337 states and 4423 transitions. [2021-08-27 07:51:30,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 4423 transitions. [2021-08-27 07:51:30,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 07:51:30,951 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:30,951 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:51:30,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 07:51:30,951 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:30,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:30,952 INFO L82 PathProgramCache]: Analyzing trace with hash 65591990, now seen corresponding path program 1 times [2021-08-27 07:51:30,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:30,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462896450] [2021-08-27 07:51:30,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:30,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:30,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:30,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462896450] [2021-08-27 07:51:30,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462896450] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:30,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:30,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:30,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182711766] [2021-08-27 07:51:30,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:30,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:30,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:30,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:30,994 INFO L87 Difference]: Start difference. First operand 3337 states and 4423 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:51:31,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:31,099 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2021-08-27 07:51:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:31,099 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:51:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:31,111 INFO L225 Difference]: With dead ends: 3403 [2021-08-27 07:51:31,111 INFO L226 Difference]: Without dead ends: 3403 [2021-08-27 07:51:31,111 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:31,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2021-08-27 07:51:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3401. [2021-08-27 07:51:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4423 transitions. [2021-08-27 07:51:31,171 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4423 transitions. Word has length 27 [2021-08-27 07:51:31,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:31,171 INFO L470 AbstractCegarLoop]: Abstraction has 3401 states and 4423 transitions. [2021-08-27 07:51:31,171 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:51:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4423 transitions. [2021-08-27 07:51:31,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 07:51:31,193 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:31,193 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:51:31,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 07:51:31,194 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:31,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:31,194 INFO L82 PathProgramCache]: Analyzing trace with hash -521214024, now seen corresponding path program 1 times [2021-08-27 07:51:31,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:31,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216976107] [2021-08-27 07:51:31,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:31,195 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:31,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:31,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:31,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216976107] [2021-08-27 07:51:31,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216976107] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:31,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:31,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:31,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318739296] [2021-08-27 07:51:31,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:31,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:31,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:31,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:31,235 INFO L87 Difference]: Start difference. First operand 3401 states and 4423 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:51:31,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:31,335 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2021-08-27 07:51:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:31,341 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:51:31,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:31,374 INFO L225 Difference]: With dead ends: 5643 [2021-08-27 07:51:31,374 INFO L226 Difference]: Without dead ends: 5643 [2021-08-27 07:51:31,375 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2021-08-27 07:51:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5129. [2021-08-27 07:51:31,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 6471 transitions. [2021-08-27 07:51:31,466 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 6471 transitions. Word has length 27 [2021-08-27 07:51:31,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:31,467 INFO L470 AbstractCegarLoop]: Abstraction has 5129 states and 6471 transitions. [2021-08-27 07:51:31,467 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:51:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 6471 transitions. [2021-08-27 07:51:31,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 07:51:31,476 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:31,476 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:51:31,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 07:51:31,476 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:31,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:31,477 INFO L82 PathProgramCache]: Analyzing trace with hash -263048586, now seen corresponding path program 1 times [2021-08-27 07:51:31,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:31,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95974900] [2021-08-27 07:51:31,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:31,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:31,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:31,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:31,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95974900] [2021-08-27 07:51:31,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95974900] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:31,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:31,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:31,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191022970] [2021-08-27 07:51:31,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:31,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:31,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:31,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:31,550 INFO L87 Difference]: Start difference. First operand 5129 states and 6471 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:51:31,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:31,653 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2021-08-27 07:51:31,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:31,653 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:51:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:31,666 INFO L225 Difference]: With dead ends: 6539 [2021-08-27 07:51:31,666 INFO L226 Difference]: Without dead ends: 6539 [2021-08-27 07:51:31,666 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 59.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states. [2021-08-27 07:51:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 6537. [2021-08-27 07:51:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6537 states to 6537 states and 7943 transitions. [2021-08-27 07:51:31,794 INFO L78 Accepts]: Start accepts. Automaton has 6537 states and 7943 transitions. Word has length 27 [2021-08-27 07:51:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:31,794 INFO L470 AbstractCegarLoop]: Abstraction has 6537 states and 7943 transitions. [2021-08-27 07:51:31,794 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:51:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 6537 states and 7943 transitions. [2021-08-27 07:51:31,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:51:31,802 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:31,802 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:51:31,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 07:51:31,803 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:31,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:31,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1022450534, now seen corresponding path program 1 times [2021-08-27 07:51:31,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:31,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755394134] [2021-08-27 07:51:31,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:31,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:31,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:31,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:31,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755394134] [2021-08-27 07:51:31,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755394134] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:31,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:31,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:31,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15263772] [2021-08-27 07:51:31,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:31,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:31,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:31,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:31,847 INFO L87 Difference]: Start difference. First operand 6537 states and 7943 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:51:31,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:31,958 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2021-08-27 07:51:31,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:31,959 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:51:31,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:31,970 INFO L225 Difference]: With dead ends: 6667 [2021-08-27 07:51:31,971 INFO L226 Difference]: Without dead ends: 6667 [2021-08-27 07:51:31,971 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:31,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2021-08-27 07:51:32,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 6665. [2021-08-27 07:51:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 7943 transitions. [2021-08-27 07:51:32,084 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 7943 transitions. Word has length 28 [2021-08-27 07:51:32,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:32,084 INFO L470 AbstractCegarLoop]: Abstraction has 6665 states and 7943 transitions. [2021-08-27 07:51:32,085 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:51:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 7943 transitions. [2021-08-27 07:51:32,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:51:32,092 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:32,092 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:51:32,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 07:51:32,093 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:32,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:32,094 INFO L82 PathProgramCache]: Analyzing trace with hash 435644520, now seen corresponding path program 1 times [2021-08-27 07:51:32,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:32,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819686329] [2021-08-27 07:51:32,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:32,094 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:32,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:32,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:32,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819686329] [2021-08-27 07:51:32,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819686329] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:32,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:32,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:32,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458248679] [2021-08-27 07:51:32,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:32,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:32,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:32,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:32,143 INFO L87 Difference]: Start difference. First operand 6665 states and 7943 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:51:32,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:32,250 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2021-08-27 07:51:32,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:32,251 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:51:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:32,266 INFO L225 Difference]: With dead ends: 10761 [2021-08-27 07:51:32,266 INFO L226 Difference]: Without dead ends: 10761 [2021-08-27 07:51:32,267 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:51:32,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10761 states. [2021-08-27 07:51:32,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10761 to 10249. [2021-08-27 07:51:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:51:32,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 11911 transitions. [2021-08-27 07:51:32,410 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 11911 transitions. Word has length 28 [2021-08-27 07:51:32,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:32,411 INFO L470 AbstractCegarLoop]: Abstraction has 10249 states and 11911 transitions. [2021-08-27 07:51:32,411 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:51:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 11911 transitions. [2021-08-27 07:51:32,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:51:32,425 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:51:32,425 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:51:32,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-27 07:51:32,425 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:51:32,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:51:32,426 INFO L82 PathProgramCache]: Analyzing trace with hash 693809958, now seen corresponding path program 1 times [2021-08-27 07:51:32,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:51:32,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492291356] [2021-08-27 07:51:32,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:51:32,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:51:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:32,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:51:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:51:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:51:32,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:51:32,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492291356] [2021-08-27 07:51:32,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492291356] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:51:32,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:51:32,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:51:32,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193325073] [2021-08-27 07:51:32,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:51:32,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:51:32,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:51:32,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:51:32,465 INFO L87 Difference]: Start difference. First operand 10249 states and 11911 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:51:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:51:32,576 INFO L93 Difference]: Finished difference Result 12807 states and 14086 transitions. [2021-08-27 07:51:32,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:51:32,577 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:51:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:51:32,577 INFO L225 Difference]: With dead ends: 12807 [2021-08-27 07:51:32,577 INFO L226 Difference]: Without dead ends: 0 [2021-08-27 07:51:32,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:51:32,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-27 07:51:32,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-27 07:51:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 07:51:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 07:51:32,578 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2021-08-27 07:51:32,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:51:32,579 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 07:51:32,579 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:51:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-27 07:51:32,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-27 07:51:32,581 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 07:51:32,582 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 07:51:32,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-27 07:51:32,585 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 07:51:32,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 07:51:32 BoogieIcfgContainer [2021-08-27 07:51:32,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 07:51:32,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 07:51:32,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 07:51:32,588 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 07:51:32,588 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:51:26" (3/4) ... [2021-08-27 07:51:32,591 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-27 07:51:32,597 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-08-27 07:51:32,597 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-08-27 07:51:32,597 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-08-27 07:51:32,602 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-08-27 07:51:32,603 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-27 07:51:32,604 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-27 07:51:32,604 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-27 07:51:32,650 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 07:51:32,650 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 07:51:32,652 INFO L168 Benchmark]: Toolchain (without parser) took 7276.55 ms. Allocated memory was 58.7 MB in the beginning and 264.2 MB in the end (delta: 205.5 MB). Free memory was 43.7 MB in the beginning and 80.4 MB in the end (delta: -36.7 MB). Peak memory consumption was 168.5 MB. Max. memory is 16.1 GB. [2021-08-27 07:51:32,652 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 46.1 MB. Free memory was 28.4 MB in the beginning and 28.3 MB in the end (delta: 36.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:51:32,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.26 ms. Allocated memory is still 58.7 MB. Free memory was 43.5 MB in the beginning and 42.7 MB in the end (delta: 848.8 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 07:51:32,653 INFO L168 Benchmark]: Boogie Preprocessor took 52.83 ms. Allocated memory is still 58.7 MB. Free memory was 42.7 MB in the beginning and 40.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 07:51:32,653 INFO L168 Benchmark]: RCFGBuilder took 519.02 ms. Allocated memory is still 58.7 MB. Free memory was 40.9 MB in the beginning and 36.2 MB in the end (delta: 4.7 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. [2021-08-27 07:51:32,654 INFO L168 Benchmark]: TraceAbstraction took 6350.95 ms. Allocated memory was 58.7 MB in the beginning and 264.2 MB in the end (delta: 205.5 MB). Free memory was 35.7 MB in the beginning and 84.6 MB in the end (delta: -48.9 MB). Peak memory consumption was 157.9 MB. Max. memory is 16.1 GB. [2021-08-27 07:51:32,654 INFO L168 Benchmark]: Witness Printer took 62.64 ms. Allocated memory is still 264.2 MB. Free memory was 84.6 MB in the beginning and 80.4 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:51:32,655 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 46.1 MB. Free memory was 28.4 MB in the beginning and 28.3 MB in the end (delta: 36.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 283.26 ms. Allocated memory is still 58.7 MB. Free memory was 43.5 MB in the beginning and 42.7 MB in the end (delta: 848.8 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 52.83 ms. Allocated memory is still 58.7 MB. Free memory was 42.7 MB in the beginning and 40.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 519.02 ms. Allocated memory is still 58.7 MB. Free memory was 40.9 MB in the beginning and 36.2 MB in the end (delta: 4.7 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6350.95 ms. Allocated memory was 58.7 MB in the beginning and 264.2 MB in the end (delta: 205.5 MB). Free memory was 35.7 MB in the beginning and 84.6 MB in the end (delta: -48.9 MB). Peak memory consumption was 157.9 MB. Max. memory is 16.1 GB. * Witness Printer took 62.64 ms. Allocated memory is still 264.2 MB. Free memory was 84.6 MB in the beginning and 80.4 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: 149]: 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, 46 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 6304.9ms, OverallIterations: 26, TraceHistogramMax: 1, EmptinessCheckTime: 100.5ms, AutomataDifference: 3258.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2001 SDtfs, 2914 SDslu, 153 SDs, 0 SdLazy, 1413 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1644.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1199.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10249occurred in iteration=25, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 969.6ms AutomataMinimizationTime, 26 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 56.6ms SsaConstructionTime, 220.5ms SatisfiabilityAnalysisTime, 1353.3ms InterpolantComputationTime, 615 NumberOfCodeBlocks, 615 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 1900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-08-27 07:51:32,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...